[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2940716.2940742acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
research-article

Lottery Pricing Equilibria

Published: 21 July 2016 Publication History

Abstract

We extend the notion of Combinatorial Walrasian Equilibrium, as defined by \citet{FGL13}, to settings with budgets. When agents have budgets, the maximum social welfare as traditionally defined is not a suitable benchmark since it is overly optimistic. This motivated the liquid welfare of \cite{DP14} as an alternative. Observing that no combinatorial Walrasian equilibrium guarantees a non-zero fraction of the maximum liquid welfare in the absence of randomization, we instead work with randomized allocations and extend the notions of liquid welfare and Combinatorial Walrasian Equilibrium accordingly. Our generalization of the Combinatorial Walrasian Equilibrium prices lotteries over bundles of items rather than bundles, and we term it a lottery pricing equilibrium.
Our results are two-fold. First, we exhibit an efficient algorithm which turns a randomized allocation with liquid expected welfare W into a lottery pricing equilibrium with liquid expected welfare 3-\sqrt{5}{2}\cdot W approx 0.3819\cdot W. Next, given access to a demand oracle and an alpha-approximate oblivious rounding algorithm for the configuration linear program for the welfare maximization problem, we show how to efficiently compute a randomized allocation which is (a) supported on polynomially-many deterministic allocations and (b) obtains [nearly] an alpha fraction of the optimal liquid expected welfare. In the case of subadditive valuations, combining both results yields an efficient algorithm which computes a lottery pricing equilibrium obtaining a constant fraction of the optimal liquid expected welfare.

References

[1]
K. J. Arrow and G. Debreu. 1954. The Existence of an Equilibrium for a Competitive Economy. Econometrica 22, 3 (1954), 265--290.
[2]
Robert J Aumann. 1975. Values of Markets with a Continuum of Traders. Econometrica 43, 4 (1975), 611--46.
[3]
Maria-Florina Balcan, Avrim Blum, and Yishay Mansour. 2008. Item pricing for revenue maximization. In EC. 50--59.
[4]
Sushil Bikhchandani and John W. Mamer. 1997. Competitive Equilibrium in an Exchange Economy with Indivisibilities. J. of Economic Theory 74, 2 (1997), 385--413.
[5]
Patrick Briest. 2006. Towards Hardness of Envy-Free Pricing. ECCC 13, 150 (2006).
[6]
Patrick Briest, Shuchi Chawla, Robert Kleinberg, and S. Matthew Weinberg. 2010. Pricing Randomized Allocations. In ACM-SIAM Symposium on Discrete Algorithms. 585--597.
[7]
Xi Chen, I. Diakonikolas, A. Orfanou, D. Paparas, Xiaorui Sun, and M. Yannakakis. 2015. On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. In Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on. 1464--1479. http://dx.doi.org/10.1109/FOCS.2015.93
[8]
Maurice Cheung and Chaitanya Swamy. 2008. Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply. In FOCS. 35--44.
[9]
Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, and Svetlana Olonetsky. 2012. Envy-Free Makespan Approximation. SIAM J. Comput. 41, 1 (2012), 12--25. http://dx.doi.org/10.1137/100801597
[10]
Nikhil R. Devanur, Bach Q. Ha, and Jason D. Hartline. 2012. Prior-free Auctions for Budgeted Agents. CoRR abs/1212.5766 (2012).
[11]
Shahar Dobzinski, Ron Lavi, and Noam Nisan. 2008. Multi-unit Auctions with Budget Limits. In FOCS. 260--269.
[12]
Shahar Dobzinski and Renato Paes Leme. 2014. Efficiency Guarantees in Auctions with Budgets. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part I. 392--404.
[13]
Shahar Dobzinski and Michael Schapira. 2006. An improved approximation algorithm for combinatorial auctions with submodular bidders. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. Society for Industrial and Applied Mathematics, 1064--1073.
[14]
Uriel Feige. 2009. On Maximizing Welfare When Utility Functions Are Subadditive. SIAM J. Comput. 39, 1 (2009), 122--142. http://dx.doi.org/10.1137/070680977
[15]
Michal Feldman, Amos Fiat, Stefano Leonardi, and Piotr Sankowski. 2012. Revenue maximizing envy-free multi-unit auctions with budgets. In ACM Conference on Electronic Commerce, EC'12, Valencia, Spain, June 4--8, 2012. 532--549. http://dx.doi.org/10.1145/2229012.2229052
[16]
Michal Feldman, Nick Gravin, and Brendan Lucier. 2013. Combinatorial Walrasian Equilibrium. In Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing (STOC'13). ACM, New York, NY, USA, 61--70.http://dx.doi.org/10.1145/2488608.2488617
[17]
Amos Fiat and Amiram Wingarten. 2009. Envy, Multi Envy, and Revenue Maximization. In WINE. 498--504.
[18]
D. Foley. 1967. Resource Allocation and the Public Sector. Yale Economics Essays 7 (1967), 45--98.
[19]
Gagan Goel, Vahab S. Mirrokni, and Renato Paes Leme. 2014. Clinching auctions beyond hard budget constraints. In ACM Conference on Economics and Computation, EC'14, Stanford, CA, USA, June 8--12, 2014. 167--184.
[20]
F. Gul and E Stacchetti. 1999a. Walrasian equilibrium with gross substitutes. Journal of Economic Theory 56 (1999), 95--124.
[21]
Faruk Gul and Ennio Stacchetti. 1999b. Walrasian Equilibrium with Gross Substitutes. J. of Economic Theory 87, 1 (1999), 95--124.
[22]
Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, and Frank McSherry. 2005. On profit-maximizing envy-free pricing. In SODA. 1164--1173.
[23]
Sergiu Hart and Noam Nisan. 2013. The Menu-size Complexity of Auctions. In Proceedings of the 14th ACM Conference on Electronic Commerce (EC'13). 565--566. http://dx.doi.org/10.1145/2482540.2482544
[24]
Jason D. Hartline and Qiqi Yan. 2011. Envy, truth, and profit. In EC. 243--252.
[25]
Alexander S. Kelso, Jr. and Vincent P. Crawford. 1982. Job Matching, Coalition Formation, and Gross Substitutes. Econometrica 50, 6 (1982), 1483--1504.
[26]
Herman B Leonard. 1983. Elicitation of Honest Preferences for the Assignment of Individuals to Positions. J. of Political Economy 91, 3 (1983), 461--79.
[27]
Andreu Mas-Colell, Michael Dennis Whinston, Jerry R Green, and others. 1995. Microeconomic theory. Vol. 1. Oxford university press New York.
[28]
Ahuva Mu'Alem. 2009.On Multi-dimensional Envy-Free Mechanisms. In ADT. 120--131.
[29]
L. S. Shapley and M. Shubik. 1971. The assignment game I: The core. International J. of Game Theory 1 (1971), 111--130.Issue 1.
[30]
John Thanassoulis. 2004. Haggling over substitutes. Journal of Economic Theory 117, 2 (2004), 217--245. http://dx.doi.org/10.1016/j.jet.2003.09.002
[31]
Hal R. Varian. 1974. Equity, envy, and efficiency. J. of Economic Theory 9, 1 (1974), 63--91.
[32]
L. Walras. 1874. Éléments d'économie politique pure; ou, Théorie de la richesse sociale. Corbaz. https://books.google.com/books?id=crUEAAAAMAAJ
[33]
Léon Walras. 2003. Elements of Pure Economics: Or the Theory of Social Wealth. Routledge.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
EC '16: Proceedings of the 2016 ACM Conference on Economics and Computation
July 2016
874 pages
ISBN:9781450339360
DOI:10.1145/2940716
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 July 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Walrasian equilibrium
  2. budgets
  3. combinatorial auctions
  4. envy-free
  5. lotteries

Qualifiers

  • Research-article

Funding Sources

  • ISF
  • EU FET
  • NSF CAREER Award
  • ERC
  • Google Focused award Algorithms for Large-scale Data analysis

Conference

EC '16
Sponsor:
EC '16: ACM Conference on Economics and Computation
July 24 - 28, 2016
Maastricht, The Netherlands

Acceptance Rates

EC '16 Paper Acceptance Rate 80 of 242 submissions, 33%;
Overall Acceptance Rate 664 of 2,389 submissions, 28%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)9
  • Downloads (Last 6 weeks)1
Reflects downloads up to 12 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Gacha Game Analysis and DesignProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35794387:1(1-45)Online publication date: 2-Mar-2023
  • (2021)The Efficiency of Resource Allocation Mechanisms for Budget-Constrained UsersMathematics of Operations Research10.1287/moor.2020.107046:2(503-523)Online publication date: 1-May-2021
  • (2020)Simple combinatorial auctions with budget constraintsTheoretical Computer Science10.1016/j.tcs.2020.07.019Online publication date: Jul-2020
  • (2019)Online Random Sampling for Budgeted SettingsTheory of Computing Systems10.1007/s00224-019-09918-yOnline publication date: 30-Mar-2019
  • (2018)The Efficiency of Resource Allocation Mechanisms for Budget-Constrained UsersProceedings of the 2018 ACM Conference on Economics and Computation10.1145/3219166.3219186(681-698)Online publication date: 11-Jun-2018
  • (2017)Liquid Welfare Maximization in Auctions with Multiple ItemsAlgorithmic Game Theory10.1007/978-3-319-66700-3_4(41-52)Online publication date: 19-Aug-2017
  • (2017)Liquid Price of AnarchyAlgorithmic Game Theory10.1007/978-3-319-66700-3_1(3-15)Online publication date: 19-Aug-2017

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media