| Publication | Date of Publication | Type |
|---|
| Non-quasi-linear agents in quasi-linear mechanisms (extended abstract) | 2026-04-15 | Paper |
Fair shares: feasibility, domination, and incentives
Mathematics of Operations Research | 2025-09-30 | Paper |
| A simple and approximately optimal mechanism for an additive buyer | 2025-08-05 | Paper |
Fair-share allocations for agents with arbitrary entitlements
Mathematics of Operations Research | 2025-01-28 | Paper |
| Making auctions robust to aftermarkets | 2024-09-25 | Paper |
On best-of-both-worlds fair-share allocations
Web and Internet Economics | 2023-08-04 | Paper |
Combinatorial auctions with endowment effect
Games and Economic Behavior | 2022-11-24 | Paper |
The menu-size complexity of revenue approximation
Games and Economic Behavior | 2022-07-15 | Paper |
Beyond Pigouvian taxes: a worst case analysis
(available as arXiv preprint) | 2022-07-06 | Paper |
Competitive equilibrium with indivisible goods and generic budgets
Mathematics of Operations Research | 2021-06-03 | Paper |
Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Peaches, lemons, and cookies: designing auction markets with dispersed information
Games and Economic Behavior | 2020-11-24 | Paper |
A Simple and Approximately Optimal Mechanism for an Additive Buyer
Journal of the ACM | 2020-11-11 | Paper |
A new approach to fair distribution of welfare
(available as arXiv preprint) | 2020-06-30 | Paper |
Incentives and coordination in bottleneck models
(available as arXiv preprint) | 2020-06-18 | Paper |
Selling complementary goods: dynamics, efficiency and revenue
(available as arXiv preprint) | 2020-05-27 | Paper |
| Secretary problems: weights and discounts | 2019-05-06 | Paper |
Matroid Secretary Problems
Journal of the ACM | 2019-02-25 | Paper |
Networks of complements
(available as arXiv preprint) | 2017-12-19 | Paper |
The menu-size complexity of revenue approximation
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Mechanism design with strategic mediators
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Truthful mechanisms with implicit payment computation
Journal of the ACM | 2016-03-24 | Paper |
Single-value combinatorial auctions and algorithmic implementation in undominated strategies
Journal of the ACM | 2015-11-11 | Paper |
Auctions with online supply
Games and Economic Behavior | 2015-05-05 | Paper |
| Matroids, secretary problems, and online mechanisms | 2014-12-18 | Paper |
Characterizing Truthful Multi-armed Bandit Mechanisms
SIAM Journal on Computing | 2014-06-04 | Paper |
The communication burden of payment determination
Games and Economic Behavior | 2013-11-14 | Paper |
Combinatorial agency
Journal of Economic Theory | 2012-05-14 | Paper |
Single-value combinatorial auctions and implementation in undominated strategies
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Mixed strategies in combinatorial agency
Journal of Artificial Intelligence Research | 2010-08-06 | Paper |
Free-riding and free-labor in combinatorial agency
Algorithmic Game Theory | 2009-12-01 | Paper |
Congestion games with malicious players
Games and Economic Behavior | 2009-08-27 | Paper |
Mechanisms for a spatially distributed market
Games and Economic Behavior | 2009-07-15 | Paper |
A Knapsack Secretary Problem with Applications
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
| Incentives in peer-to-peer systems | 2008-09-12 | Paper |
Computationally-feasible truthful auctions for convex bundles
Games and Economic Behavior | 2008-07-11 | Paper |
On the Approximability of Combinatorial Exchange Problems
Algorithmic Game Theory | 2008-05-02 | Paper |
scientific article; zbMATH DE number 2243363 (Why is no real title available?)
(available as arXiv preprint) | 2006-01-04 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
