No Ascending Auction can find Equilibrium for SubModular valuations
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- T. Andersson & C. Andersson & A. Talman, 2013. "Sets in excess demand in simple ascending auctions with unit-demand bidders," Annals of Operations Research, Springer, vol. 211(1), pages 27-36, December.
- Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
- Paes Leme, Renato, 2017. "Gross substitutability: An algorithmic survey," Games and Economic Behavior, Elsevier, vol. 106(C), pages 294-316.
- Gul, Faruk & Stacchetti, Ennio, 2000. "The English Auction with Differentiated Commodities," Journal of Economic Theory, Elsevier, vol. 92(1), pages 66-95, May.
- Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May.
- Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
- Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
- Zhang, Xieji, 2024. "The ascending auction with flexible reporting," Mathematical Social Sciences, Elsevier, vol. 132(C), pages 28-39.
- Eric Balkanski & Renato Paes Leme, 2020. "On the Construction of Substitutes," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 272-291, February.
- Kazuo Murota & Akiyoshi Shioura & Zaifu Yang, 2014. "Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis," Discussion Papers 14/27, Department of Economics, University of York.
- Andersson, Tommy & Yang, Zaifu & Zhang, Dongmo, 2015.
"How to efficiently allocate houses under price controls?,"
Economics Letters, Elsevier, vol. 130(C), pages 97-99.
- Tommy Andersson & Zaifu Yang & Dongmo Zhang, 2014. "How to Efficiently Allocate Houses under Price Controls?," Discussion Papers 14/05, Department of Economics, University of York.
- Andersson , Tommy & Yang , Zaifu & Zhang , Dongmo, 2014. "How to Efficiently Allocate Houses under Price Controls?," Working Papers 2014:24, Lund University, Department of Economics.
- Ozan Candogan & Markos Epitropou & Rakesh V. Vohra, 2021. "Competitive Equilibrium and Trading Networks: A Network Flow Approach," Operations Research, INFORMS, vol. 69(1), pages 114-147, January.
- Gerard van der Laan & Zaifu Yang, 2016.
"An ascending multi-item auction with financially constrained bidders,"
The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 109-149, December.
- Gerard van der Laan & Zaifu Yang, 2008. "An Ascending Multi-Item Auction with Financially Constrained Bidders," Tinbergen Institute Discussion Papers 08-017/1, Tinbergen Institute.
- Gerard van der Laan & Zaifu Yang, 2011. "An Ascending Multi-Item Auction with Financially Constrained Bidders," Discussion Papers 11/04, Department of Economics, University of York.
- Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
- Ingebretsen Carlson, Jim, 2016. "An Auction with Approximated Bidder Preferences - When an Auction has to be Quick," Working Papers 2016:12, Lund University, Department of Economics.
- Paul Dütting & Vasilis Gkatzelis & Tim Roughgarden, 2017. "The Performance of Deferred-Acceptance Auctions," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 897-914, November.
- Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions I: Demand Queries," Discussion Paper Series dp381, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
- Jim Ingebretsen Carlson, 2020. "A speedy auction using approximated bidders’ preferences," Annals of Operations Research, Springer, vol. 288(1), pages 65-93, May.
- De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
- Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
- Paes Leme, Renato, 2017. "Gross substitutability: An algorithmic survey," Games and Economic Behavior, Elsevier, vol. 106(C), pages 294-316.
- Elizabeth Baldwin & Paul W. Goldberg & Paul Klemperer & Edwin Lock, 2019.
"Solving Strong-Substitutes Product-Mix Auctions,"
Economics Papers
2019-W08, Economics Group, Nuffield College, University of Oxford.
- Klemperer, Paul & Baldwin, Elizabeth & Goldberg, Paul & Lock, Edwin, 2020. "Solving Strong-Substitutes Product-Mix Auctions," CEPR Discussion Papers 14976, C.E.P.R. Discussion Papers.
- Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions II: Ascending Auctions," Discussion Paper Series dp382, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Ozan Candogan & Saša Pekeč, 2018. "Efficient Allocation and Pricing of Multifeatured Items," Management Science, INFORMS, vol. 64(12), pages 5521-5543, December.
More about this item
NEP fields
This paper has been announced in the following NEP Reports:- NEP-GTH-2024-01-15 (Game Theory)
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2312.00522. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.