Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Alexander Haberman

dblp:410/3584 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0001-3828-8738ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Theory of computation · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design
auction design
0.912025
Auctions with Withdrawal Rights: A Foundation for Uniform Price · EC 2025
Algorithmic game theory and mechanism design › mechanism design › optimal mechanism design
multidimensional screening
0.912025
Multidimensional Screening with Returns · EC 2025
Algorithmic game theory and mechanism design
pricing
0.912025
Multidimensional Screening with Returns · EC 2025
Algorithmic game theory and mechanism design › mechanism design › auction design › multi-unit auction
uniform-price auction
0.912025
Auctions with Withdrawal Rights: A Foundation for Uniform Price · EC 2025

Methods — techniques the papers use, named apart from their topics

mechanism design · 1.7
YearPublicationVenuePosition
2025 Auctions with Withdrawal Rights: A Foundation for Uniform Price
abstract
When bidders have correlated private information, optimal auction mechanisms screen bidders based on their beliefs. We show that the possibility of ex post withdrawal by bidders provides a foundation for uniform price auctions that applies even in settings with correlated information. Withdrawal rights therefore provide a realistic framework for studying optimal auction design with correlated information. Our results are not driven by ex post individual rationality constraints or their interaction with the winner's curse. Instead, our analysis relies on a strategic impact of withdrawal rights: bidders can engage in "double deviations" that involve misreporting and then (sometimes) withdrawing ex post.
Alexander Haberman, Ravi Jagadeesan
EC1
2025 Multidimensional Screening with Returns
abstract
A monopolist wants to sell multiple goods, accounting for the possibility of returns. For any bundle purchased, a buyer can return any part of the bundle for a partial refund specified by a return policy. The seller is constrained to offer additive return policies: the total price of a bundle must be divided into return values for each of the goods in the bundle. We show that if the buyer's values are additive and independent across goods, then selling each good separately is optimal. The result applies even if the seller can use stochastic mechanisms, and holds for general multidimensional screening problems. We show that selling separately remains approximately optimal if the buyer experiences small return costs, as well as if the return policy only has to be close to additive or the buyer's values are weakly correlated. Applying our analysis to multiproduct pricing without returns, we introduce a new concept of bundle discounts and show that obtaining revenue gains from using any complex mechanism requires discounting bundles in our sense.
Alexander Haberman, Ravi Jagadeesan, Frank Yang
EC1