[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Optimal Pricing for MHR and λ-regular Distributions

Published: 02 January 2021 Publication History

Abstract

We study the performance of anonymous posted-price selling mechanisms for a standard Bayesian auction setting, where n bidders have i.i.d. valuations for a single item. We show that for the natural class of Monotone Hazard Rate (MHR) distributions, offering the same, take-it-or-leave-it price to all bidders can achieve an (asymptotically) optimal revenue. In particular, the approximation ratio is shown to be 1+O(ln ln n/ ln n), matched by a tight lower bound for the case of exponential distributions. This improves upon the previously best-known upper bound of e/(e−1)≈ 1.58 for the slightly more general class of regular distributions. In the worst case (over n), we still show a global upper bound of 1.35. We give a simple, closed-form description of our prices, which, interestingly enough, relies only on minimal knowledge of the prior distribution, namely, just the expectation of its second-highest order statistic.
Furthermore, we extend our techniques to handle the more general class of λ-regular distributions that interpolate between MHR (λ =0) and regular (λ =1). Our anonymous pricing rule now results in an asymptotic approximation ratio that ranges smoothly, with respect to λ, from 1 (MHR distributions) to e/(e−1) (regular distributions). Finally, we explicitly give a class of continuous distributions that provide matching lower bounds, for every λ.

References

[1]
Gagan Aggarwal, Gagan Goel, and Aranyak Mehta. 2009. Efficiency of (revenue-) optimal mechanisms. In Proceedings of the 10th ACM Conference on Electronic Commerce (EC’09). 235--242.
[2]
Saeed Alaei. 2014. Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM J. Comput. 43, 2 (2014), 930--972.
[3]
Saeed Alaei, Jason Hartline, Rad Niazadeh, Emmanouil Pountourakis, and Yang Yuan. 2015. Optimal auctions vs. anonymous pricing. In Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS’15). 1446--1463.
[4]
Charalambos D. Aliprantis and Kim C. Border. 2006. Infinite Dimensional Analysis: A Hitchhiker’s Guide (3rd ed.). Springer-Verlag.
[5]
Barry C. Arnold, N. Balakrishnan, and H. N. Nagaraja. 2008. A First Course in Order Statistics. SIAM.
[6]
Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, and Yaron Singer. 2017. Posting prices with unknown distributions. ACM Trans. Econ. Comput. 5, 2 (2017), 13:1--13:20.
[7]
Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, and Aleksandrs Slivkins. 2015. Dynamic pricing with limited supply. ACM Trans. Econ. Comput. 3, 1 (2015), 1--26.
[8]
Richard E. Barlow and Albert W. Marshall. 1964. Bounds for distributions with monotone hazard rate, i. Ann. Math. Stat. 35, 3 (1964), 1234--1257.
[9]
Richard E. Barlow and Frank Proschan. 1996. Mathematical Theory of Reliability. SIAM.
[10]
Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, and Kamesh Munagala. 2010. Budget constrained auctions with heterogeneous items. In Proceedings of the 42nd ACM Symposium on Theory of Computing. ACM, 379--388.
[11]
Liad Blumrosen and Thomas Holenstein. 2008. Posted prices vs. negotiations: An asymptotic analysis. In Proceedings of the 9th ACM Conference on Electronic Commerce (EC’08). 49.
[12]
Jeremy Bulow and Paul Klemperer. 1996. Auctions versus negotiations. Amer. Econ. Rev. 86, 1 (1996), 180--194. http://www.jstor.org/stable/2118262
[13]
Yang Cai and Constantinos Daskalakis. 2011. Extreme-value theorems for optimal multidimensional pricing. In Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS’11). 522--531.
[14]
Andrew Caplin and Barry Nalebuff. 1991. Aggregation and social choice: A mean voter theorem. Econometrica 59, 1 (1991), 1--24.
[15]
Nicolo Cesa-Bianchi, Claudio Gentile, and Yishay Mansour. 2015. Regret minimization for reserve prices in second-price auctions. IEEE Trans. Info. Theory 61, 1 (2015), 549--564.
[16]
Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. 2010. Multi-parameter mechanism design and sequential posted pricing. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC’10). 311--320.
[17]
Richard Cole and Shravas Rao. 2017. Applications of -strongly regular distributions to bayesian auctions. ACM Trans. Econ. Comput. 5, 4 (2017), 18:1--18:29.
[18]
Richard Cole and Tim Roughgarden. 2014. The sample complexity of revenue maximization. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC’14). 243--252.
[19]
José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, and Tjark Vredeveld. 2017. Posted price mechanisms for a random stream of customers. In Proceedings of the 18th ACM Conference on Economics and Computation (EC’17). 169--186.
[20]
Jose Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, and Tjark Vredeveld. 2019. Recent developments in prophet inequalities. ACM SIGecom Exchanges 17, 1 (2019), 61--70.
[21]
José Correa, Patricio Foncea, Dana Pizarro, and Victor Verdugo. 2019. From pricing to prophets, and back!Oper. Res. Lett. 47, 1 (2019), 25--29.
[22]
Constantinos Daskalakis and S. Matthew Weinberg. 2012. Symmetries and optimal multi-dimensional mechanism design. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC’12). 370--387.
[23]
Peerapong Dhangwatnotai, Tim Roughgarden, and Qiqi Yan. 2014. Revenue maximization with a single sample. Games Econ. Behav. 91, C (2014), 318--333.
[24]
Paul Dütting, Felix A. Fischer, and Max Klimm. 2016. Revenue gaps for discriminatory and anonymous sequential posted pricing. Retrieved from https://arxiv:1607.07105v2.
[25]
Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, and Sahil Singla. 2018. Prophet secretary for combinatorial auctions and matroids. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’18). 700--714.
[26]
Christian Ewerhart. 2013. Regular type distributions in mechanism design and -concavity. Econ. Theory 53, 3 (2013), 591—603.
[27]
Yiding Feng, Jason D. Hartline, and Yingkai Li. 2019. Optimal auctions vs. anonymous pricing: Beyond linear utility. In Proceedings of the 20th ACM Conference on Economics and Computation (EC’19). 885--886.
[28]
Hu Fu, Nicole Immorlica, Brendan Lucier, and Philipp Strack. 2015. Randomization beats second price as a prior-independent auction. In Proceedings of the 16th ACM Conference on Economics and Computation (EC’15). 323--323.
[29]
Yiannis Giannakopoulos and Elias Koutsoupias. 2018. Duality and optimality of auctions for uniform distributions. SIAM J. Comput. 47, 1 (2018), 121--165.
[30]
Yiannis Giannakopoulos, Elias Koutsoupias, and Philip Lazos. 2017. Online market intermediation. In Proceedings of 44th International Colloquium on Automata, Languages, and Programming (ICALP’17), Vol. 80. 47:1--47:14. arxiv:1703.09279
[31]
Yiannis Giannakopoulos and Maria Kyropoulou. 2017. The VCG mechanism for bayesian scheduling. ACM Trans. Econ. Comput. 5, 4 (2017), 19:1--19:16.
[32]
Yiannis Giannakopoulos and Keyu Zhu. 2018. Optimal pricing for MHR distributions. In Proceedings of the 14th Conference on Web and Internet Economics (WINE’18). 154--167. arxiv:1810.00800v1
[33]
Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. 1989. Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Longman, Boston, MA.
[34]
Mohammad T. Hajiaghayi, Robert D. Kleinberg, and T. Sandholm. 2007. Automated online mechanism design and prophet inequalities. In Proceedings of the 22nd Conference on Artificial Intelligence (AAAI’07).
[35]
G. H. Hardy, J. E. Littlewood, and G. Pólya. 1952. Inequalities (2nd ed.). Cambridge University Press.
[36]
Jason D. Hartline. 2013. Mechanism Design and Approximation. Retrieved from http://jasonhartline.com/MDnA/.
[37]
Jason D. Hartline and Tim Roughgarden. 2009. Simple versus optimal mechanisms. In Proceedings of the 10th ACM Conference on Electronic Commerce (EC’09). 225--234.
[38]
T. P. Hill and Robert P. Kertz. 1982. Comparisons of stop rule and supremum expectations of I.I.D. random variables. Ann. Probabil. 10, 2 (1982), 336--345.
[39]
Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, and Tao Xiao. 2019. Tight approximation ratio of anonymous pricing. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC’19). 674--685.
[40]
Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, and Tao Xiao. 2019. Tight revenue gaps among simple mechanisms. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’19). 209--228.
[41]
Robert Kleinberg and Seth Matthew Weinberg. 2012. Matroid prophet inequalities. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC’12). 123--136.
[42]
Vlad Mares and Jeroen M. Swinkels. 2011. Near-optimality of second price mechanisms in a class of asymmetric auctions. Games Econ. Behav. 72, 1 (2011), 218--241.
[43]
Vlad Mares and Jeroen M. Swinkels. 2014. On the analysis of asymmetric first price auctions. J. Econ. Theory 152 (2014), 1--40.
[44]
Roger B. Myerson. 1981. Optimal auction design. Math. Oper. Res. 6, 1 (1981), 58--73.
[45]
Noam Nisan. 2007. Introduction to mechanism design (for computer scientists). In Algorithmic Game Theory, Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay Vazirani (Eds.). Cambridge University Press, Chapter 9.
[46]
Frank W. J. Olver, Daniel W. Lozier, Ronald F. Boisvert, and Charles W. Clark. 2010. NIST Handbook of Mathematical Functions. Cambridge University Press.
[47]
Walter Rudin. 1976. Principles of Mathematical Analysis (3rd ed.). McGraw-Hill.
[48]
Nikolaus Schweizer and Nora Szech. 2019. Performance bounds for optimal sales mechanisms beyond the monotone hazard rate condition. J. Math. Econ. 82 (2019), 202--213.
[49]
Qiqi Yan. 2011. Mechanism design via correlation gap. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’11). 710--719.

Cited By

View all
  • (2022)Robust Revenue Maximization Under Minimal Statistical InformationACM Transactions on Economics and Computation10.1145/354660610:3(1-34)Online publication date: 2-Sep-2022

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Economics and Computation
ACM Transactions on Economics and Computation  Volume 9, Issue 1
Special Issue on WINE'18: Part 1, and Regular Papers
March 2021
182 pages
ISSN:2167-8375
EISSN:2167-8383
DOI:10.1145/3446654
Issue’s Table of Contents
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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 January 2021
Accepted: 01 December 2019
Revised: 01 October 2019
Received: 01 April 2019
Published in TEAC Volume 9, Issue 1

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. λ-regularity
  2. Pricing
  3. hazard rate distributions
  4. optimal auctions
  5. regular distributions

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

  • Alexander von Humboldt Foundation

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)25
  • Downloads (Last 6 weeks)5
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Robust Revenue Maximization Under Minimal Statistical InformationACM Transactions on Economics and Computation10.1145/354660610:3(1-34)Online publication date: 2-Sep-2022

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media