Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3465456.3467643acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
research-article
Public Access

On Simple Mechanisms for Dependent Items

Published: 18 July 2021 Publication History

Abstract

We study the problem of selling n heterogeneous items to a single buyer, whose values for different items are dependent. Under arbitrary dependence, Hart and Nisan[30] show that no simple mechanism can achieve a non-negligible fraction of the optimal revenue even with only two items. We consider the setting where the buyer's type is drawn from a correlated distribution that can be captured by a Markov Random Field, one of the most prominent frameworks for modeling high-dimensional distributions with structure.
If the buyer's valuation is additive or unit-demand, we extend the result to all MRFs and show that $\max\srev,brev\ $ can achieve an Ømega(1/eO(Δ))-fraction of the optimal revenue, where Δ is a parameter of the MRF that is determined by how much the value of an item can be influenced by the values of the other items. We further show that the exponential dependence on Δ is unavoidable for our approach and a polynomial dependence on Δ is unavoidable for any approach. When the buyer has a XOS valuation, we show that max(SRev,BRev) achieves at least an $Ømega(1/eO(Δ) + 1/√nγ)-fraction of the optimal revenue, where γ is the spectral gap of the Glauber dynamics of the MRF. Note that the values of Δ and 1/nγ increase as the dependence between items strengthens. In the special case of independently distributed items, Δ=0 and 1/nγ ≥ 1, and our results recover the known constant factor approximations for a XOS buyer[41]. We further extend our parametric approximation to several other well-studied dependency measures such as the Dobrushin coefficient [27] and the inverse temperature. In particular, we show that if the MRF is in the high temperature regime, max(SRev,BRev) is still a constant factor approximation to the optimal revenue even for a XOS buyer. Our results are based on the Duality-Framework by Cai et al.[14] and a new concentration inequality for XOS functions over dependent random variables.

Supplementary Material

ZIP File (ec0593faux.zip)
Inside the zip file, there is only a file called "On_Simple_Mechanisms_for_Dependent_Items_appendix.pdf" that contains some proofs of the paper.

References

[1]
Saeed Alaei. 2011. Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers. In the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS).
[2]
Saeed Alaei, Hu Fu, Nima Haghpanah, Jason Hartline, and Azarakhsh Malekian. 2012. Bayesian Optimal Auctions via Multi- to Single-agent Reduction. In the 13th ACM Conference on Electronic Commerce (EC).
[3]
Saeed Alaei, Hu Fu, Nima Haghpanah, and Jason D. Hartline. 2013. The Simple Economics of Approximately Optimal Auctions. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26--29 October, 2013, Berkeley, CA, USA. IEEE Computer Society, 628--637. https://doi.org/10.1109/FOCS.2013.73
[4]
Moshe Babaioff, Nicole Immorlica, Brendan Lucier, and S. Matthew Weinberg. 2014. A Simple and Approximately Optimal Mechanism for an Additive Buyer. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18--21, 2014. 21--30. https://doi.org/10.1109/FOCS.2014.11
[5]
MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, and Saeed Seddighin. 2015. Revenue maximization for selling multiple correlated items. In Algorithms-ESA 2015. Springer, 95--105.
[6]
Anand Bhalgat, Sreenivas Gollapudi, and Kamesh Munagala. 2013. Optimal auctions via the multiplicative weight method. In ACM Conference on Electronic Commerce, EC '13, Philadelphia, PA, USA, June 16--20, 2013, Michael J. Kearns, R. Preston McAfee, and É va Tardos (Eds.). ACM, 73--90. https://doi.org/10.1145/2482540.2482547
[7]
Sté phane Boucheron, Gá bor Lugosi, and Pascal Massart. 2000. A sharp concentration inequality with applications. Random Struct. Algorithms, Vol. 16, 3 (2000), 277--292.
[8]
Patrick Briest, Shuchi Chawla, Robert Kleinberg, and S Matthew Weinberg. 2015. Pricing lotteries. Journal of Economic Theory, Vol. 156 (2015), 144--174.
[9]
Johannes Brustle, Yang Cai, and Constantinos Daskalakis. 2020. Multi-Item Mechanisms without Item-Independence: Learnability via Robustness (EC '20). Association for Computing Machinery, New York, NY, USA, 715--761. https://doi.org/10.1145/3391403.3399541
[10]
Yang Cai and Constantinos Daskalakis. 2011. Extreme-Value Theorems for Optimal Multidimensional Pricing. In the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS).
[11]
Yang Cai, Constantinos Daskalakis, and S. Matthew Weinberg. 2012a. An Algorithmic Characterization of Multi-Dimensional Mechanisms. In the 44th Annual ACM Symposium on Theory of Computing (STOC).
[12]
Yang Cai, Constantinos Daskalakis, and S. Matthew Weinberg. 2012b. Optimal Multi-Dimensional Mechanism Design: Reducing Revenue to Welfare Maximization. In the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS).
[13]
Yang Cai, Constantinos Daskalakis, and S. Matthew Weinberg. 2013. Understanding Incentives: Mechanism Design becomes Algorithm Design. In the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS).
[14]
Yang Cai, Nikhil R. Devanur, and S. Matthew Weinberg. 2016. A Duality Based Unified Approach to Bayesian Mechanism Design. In the 48th Annual ACM Symposium on Theory of Computing (STOC).
[15]
Yang Cai and Zhiyi Huang. 2013. Simple and Nearly Optimal Multi-Item Auctions. In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
[16]
Yang Cai and Mingfei Zhao. 2016. Simple Mechanisms for Subadditive Buyers via Duality. CoRR, Vol. abs/1611.06910 (2016). arxiv: 1611.06910 http://arxiv.org/abs/1611.06910
[17]
Yang Cai and Mingfei Zhao. 2017. Simple Mechanisms for Subadditive Buyers via Duality. In the 49th Annual ACM Symposium on Theory of Computing (STOC).
[18]
Shuchi Chawla, Jason D. Hartline, and Robert D. Kleinberg. 2007. Algorithmic Pricing via Virtual Valuations. In the 8th ACM Conference on Electronic Commerce (EC).
[19]
Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. 2010a. Multi-Parameter Mechanism Design and Sequential Posted Pricing. In the 42nd ACM Symposium on Theory of Computing (STOC).
[20]
Shuchi Chawla, David L. Malec, and Balasubramanian Sivan. 2010b. The power of randomness in bayesian optimal mechanism design. In Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7--11, 2010, David C. Parkes, Chrysanthos Dellarocas, and Moshe Tennenholtz (Eds.). ACM, 149--158. https://doi.org/10.1145/1807342.1807366
[21]
Shuchi Chawla and J. Benjamin Miller. 2016. Mechanism Design for Subadditive Agents via an Ex-Ante Relaxation, In Proceedings of the 2016 ACM Conference on Economics and Computation, EC '16, Maastricht, The Netherlands, July 24--28, 2016, Vincent Conitzer, Dirk Bergemann, and Yiling Chen (Eds.). CoRR, 579--596. https://doi.org/10.1145/2940716.2940756
[22]
Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, and Siddhartha Jayanti. 2019 a. Learning from Weakly Dependent Data under Dobrushin's Condition. In Conference on Learning Theory, COLT 2019, 25--28 June 2019, Phoenix, AZ, USA (Proceedings of Machine Learning Research), Alina Beygelzimer and Daniel Hsu (Eds.), Vol. 99. PMLR, 914--928. http://proceedings.mlr.press/v99/dagan19a.html
[23]
Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, and Siddhartha Jayanti. 2019 b. Learning from weakly dependent data under Dobrushin's condition. CoRR, Vol. abs/1906.09247 (2019). arxiv: 1906.09247 http://arxiv.org/abs/1906.09247
[24]
Constantinos Daskalakis, Nikhil R. Devanur, and S. Matthew Weinberg. 2015. Revenue Maximization and Ex-Post Budget Constraints. In Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, Portland, OR, USA, June 15--19, 2015, Tim Roughgarden, Michal Feldman, and Michael Schwarz (Eds.). ACM, 433--447. https://doi.org/10.1145/2764468.2764521
[25]
Constantinos Daskalakis, Nishanth Dikkala, and Gautam Kamath. 2018. Testing ising models. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 1989--2007.
[26]
Constantinos Daskalakis, Nishanth Dikkala, and Gautam Kamath. 2019. Testing ising models. IEEE Transactions on Information Theory, Vol. 65, 11 (2019), 6829--6852.
[27]
PL Dobruschin. 1968. The description of a random field by means of conditional probabilities and conditions of its regularity. Theory of Probability & Its Applications, Vol. 13, 2 (1968), 197--224.
[28]
RL Dobrushin and SB Shlosman. 1987. Completely analytical interactions: constructive description. Journal of Statistical Physics, Vol. 46, 5--6 (1987), 983--1014.
[29]
Reza Gheissari, Eyal Lubetzky, Yuval Peres, et al. 2018. Concentration inequalities for polynomials of contracting Ising models. Electronic Communications in Probability, Vol. 23 (2018).
[30]
Sergiu Hart and Noam Nisan. 2019. Selling multiple correlated goods: Revenue maximization and menu-size complexity. Journal of Economic Theory, Vol. 183 (2019), 991 -- 1029. https://doi.org/10.1016/j.jet.2019.07.006
[31]
Nicole Immorlica, Sahil Singla, and Bo Waggoner. 2020. Prophet Inequalities with Linear Correlations and Augmentations. In EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13--17, 2020, Pé ter Biró, Jason Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 159--185. https://doi.org/10.1145/3391403.3399452
[32]
Ross Kindermann and Laurie Snell. 1980. Markov random fields and their applications. Vol. 1. American Mathematical Society. https://doi.org/10.1090/conm/001
[33]
Robert Kleinberg and S. Matthew Weinberg. 2012. Matroid Prophet Inequalities. In the 44th Annual ACM Symposium on Theory of Computing (STOC).
[34]
Ulrich Krengel and Louis Sucheston. 1978. On semiamarts, amarts, and processes with finite value. Probability on Banach spaces, Vol. 4 (1978), 197--266.
[35]
Steffen L. Lauritzen. 1996. Graphical Models .Oxford University Press.
[36]
David A. Levin, Yuval Peres, and Elizabeth L. Wilmer. 2009. Markov chains and mixing times. American Mathematical Soc., Providence (2009).
[37]
Xinye Li and Andrew Chi-Chih Yao. 2013. On Revenue Maximization for Selling Multiple Independently Distributed Items. Proceedings of the National Academy of Sciences, Vol. 110, 28 (2013), 11232--11237.
[38]
Alexandros Psomas, Ariel Schvartzman, and S Matthew Weinberg. 2019. Smoothed analysis of multi-item auctions with correlated values. In Proceedings of the 2019 ACM Conference on Economics and Computation. 417--418.
[39]
Dana Randall. 2006. Slow mixing of Glauber dynamics via topological obstructions. In Symposium on Discrete Algorithms: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, Vol. 22. 870--879.
[40]
Amir Ronen. 2001. On approximating optimal auctions. In Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), Tampa, Florida, USA, October 14--17, 2001, Michael P. Wellman and Yoav Shoham (Eds.). ACM, 11--17. https://doi.org/10.1145/501158.501160
[41]
Aviad Rubinstein and S. Matthew Weinberg. 2015. Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity. In Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, Portland, OR, USA, June 15--19, 2015. 377--394. https://doi.org/10.1145/2764468.2764510
[42]
Ester Samuel-Cahn et al. 1984. Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability, Vol. 12, 4 (1984), 1213--1216.
[43]
Daniel W Stroock and Boguslaw Zegarlinski. 1992. The logarithmic Sobolev inequality for discrete spin systems on a lattice. Communications in Mathematical Physics, Vol. 149, 1 (1992), 175--193.
[44]
Liming Wu. 2006. Poincaré and transportation inequalities for Gibbs measures under the Dobrushin uniqueness condition. Ann. Probab., Vol. 34, 5 (09 2006), 1960--1989. https://doi.org/10.1214/009117906000000368
[45]
Andrew Chi-Chih Yao. 2015. An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications, In SODA. CoRR (2015). http://arxiv.org/abs/1406.3278

Cited By

View all
  • (2023)Prophet Inequalities with Linear Correlations and AugmentationsACM Transactions on Economics and Computation10.1145/362327311:3-4(1-29)Online publication date: 19-Dec-2023
  • (2023)Simultaneous Auctions are Approximately Revenue-Optimal for Subadditive Bidders2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00017(134-147)Online publication date: 6-Nov-2023

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
EC '21: Proceedings of the 22nd ACM Conference on Economics and Computation
July 2021
950 pages
ISBN:9781450385541
DOI:10.1145/3465456
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: 18 July 2021

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Markov random field
  2. algorithmic game theory
  3. dependent items
  4. graphical models
  5. mechanism design

Qualifiers

  • Research-article

Funding Sources

Conference

EC '21
Sponsor:

Acceptance Rates

Overall Acceptance Rate 664 of 2,389 submissions, 28%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)76
  • Downloads (Last 6 weeks)16
Reflects downloads up to 22 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Prophet Inequalities with Linear Correlations and AugmentationsACM Transactions on Economics and Computation10.1145/362327311:3-4(1-29)Online publication date: 19-Dec-2023
  • (2023)Simultaneous Auctions are Approximately Revenue-Optimal for Subadditive Bidders2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00017(134-147)Online publication date: 6-Nov-2023

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media