2000 character limit reached
No Ascending Auction can find Equilibrium for SubModular valuations
Published 1 Dec 2023 in cs.GT and econ.TH | (2312.00522v1)
Abstract: We show that no efficient ascending auction can guarantee to find even a minimal envy-free price vector if all valuations are submodular, assuming a basic complexity theory's assumption.
- Sets in excess demand in simple ascending auctions with unit-demand bidders. Annals of Operations Research, pages 1–10, 2013.
- L. M. Ausubel. Walrasian ta^^𝑎\hat{a}over^ start_ARG italic_a end_ARGtonnement for discrete goods. Manuscript, 2005.
- Submodular functions: Learnability, structure, and optimization. SIAM J. Comput., 47(3):703–754, 2018.
- O. Ben-Zwi. Walrasian’s characterization and a universal ascending auction. Games Econ. Behav., 104:456–467, 2017.
- Ascending auctions and walrasian equilibrium. CoRR, abs/1301.1153, 2013.
- L. Blumrosen and N. Nisan. Informational limitations of ascending combinatorial auctions. J. Econ. Theory, 145(3):1203–1223, 2010.
- D. Chakrabarty and G. Goel. On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and gap. In FOCS, pages 687–696, 2008.
- Multi-item auctions. The Journal of Political Economy, pages 863–872, 1986.
- Approximation algorithms for combinatorial auctions with complement-free bidders. In STOC, pages 610–618, 2005.
- S. Dobzinski and M. Schapira. An improved approximation algorithm for combinatorial auctions with submodular bidders. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pages 1064–1073. ACM Press, 2006.
- S. Dobzinski and J. Vondrák. Communication complexity of combinatorial auctions with submodular valuations. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pages 1205–1215. SIAM, 2013.
- U. Feige. On maximizing welfare when utility functions are subadditive. In STOC, pages 41–50, 2006.
- U. Feige and J. Vondrák. The submodular welfare problem with demand queries. Theory Comput., 6(1):247–290, 2010.
- F. Gul and E. Stacchetti. The english auction with differentiated commodities. Journal of Economic Theory, 92(1):66 – 95, 2000.
- P. Hall. On representatives of subsets. Journal of the London Mathematical Society, s1-10(1):26–30, 1935.
- H.W.Kuhn. The hungarian method for the assignment problem. Naval research logistics quarterly, 2(1-2):83–97, 1955.
- R. M. Karp. Reducibility among combinatorial problems, 1972.
- Job matching, coalition formation, and gross substitutes. Econometrica, 50(6):1483–1504, 1982.
- Inapproximability results for combinatorial auctions with submodular utility functions. Algorithmica, 52(1):3–18, 2008.
- D. E. Knuth. The asymptotic number of geometries. J. Comb. Theory, Ser. A, 16(3):398–400, 1974.
- Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior, 55(2):270–296, 2006.
- R. P. Leme. Gross substitutability: An algorithmic survey. Games Econ. Behav., 106:294–316, 2017.
- Microeconomic Theory. Oxford university press, 1995.
- T. Roughgarden and I. Talgam-Cohen. Why prices need algorithms. In Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC ’15, page 19–36, New York, NY, USA, 2015. Association for Computing Machinery.
- M. Sipser. Introduction to the Theory of Computation. PWS Publishing Company, 1997 - third edition 2012.
- J. Vondrák. Optimal approximation for the submodular welfare problem in the value oracle model. In Cynthia Dwork, editor, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pages 67–74. ACM, 2008.
- J. Vondrák. Symmetry and approximability of submodular maximization problems. In 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pages 651–670. IEEE Computer Society, 2009.
- L. Walras. Éléments d’Économie Politique Pure, ou Théorie de la Richesse Sociale. Corbaz, Lausanne, 1874.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
