IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2609.05499.html

A 1.283 Price-of-Anarchy Bound for the Repeated Virtual First-Price Auction

Author

Listed:
  • Endre Cs'oka

Abstract

We study the repeated allocation of a single indivisible resource among $n$ strategic players. Each player $i$ has a privately known value distribution $D_i$, and values are drawn independently across players and periods. The goal is to find fair and efficient mechanisms. We apply the repeated first-price auction with equal initial endowments of virtual money. We show that each player can asymptotically secure the same fair-floor guarantee $f(D_i)$ as in Cs\'oka 2026; consequently, the mechanism is $1.283$-optimal. This provides a simpler and more robust alternative mechanism for this special case and may also help derive sharper upper bounds on the price of anarchy.

Suggested Citation

  • Endre Cs'oka, 2026. "A 1.283 Price-of-Anarchy Bound for the Repeated Virtual First-Price Auction," Papers 2609.05499, arXiv.org.
    • Handle: RePEc:arx:papers:2609.05499
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2609.05499
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Artur Gorokh & Siddhartha Banerjee & Krishnamurthy Iyer, 2021. "From Monetary to Nonmonetary Mechanism Design via Artificial Currencies," Mathematics of Operations Research, INFORMS, vol. 46(3), pages 835-855, August.
    2. Matthew O Jackson & Hugo F Sonnenschein, 2007. "Overcoming Incentive Constraints by Linking Decisions -super-1," Econometrica, Econometric Society, vol. 75(1), pages 241-257, January.
    3. Eric Budish & Gérard P. Cachon & Judd B. Kessler & Abraham Othman, 2017. "Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation," Operations Research, INFORMS, vol. 65(2), pages 314-336, April.
    4. Santiago R. Balseiro & Huseyin Gurkan & Peng Sun, 2019. "Multiagent Mechanism Design Without Money," Operations Research, INFORMS, vol. 67(5), pages 1417-1436, September.
    5. Susan Athey & Ilya Segal, 2013. "An Efficient Dynamic Mechanism," Econometrica, Econometric Society, vol. 81(6), pages 2463-2485, November.
    Full references (including those not matched with items on IDEAS)

    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.
    1. Julien Combe & Vladyslav Nora & Olivier Tercieux, 2021. "Dynamic assignment without money: Optimality of spot mechanisms," Working Papers 2021-11, Center for Research in Economics and Statistics.
    2. Ezzat Elokda & Saverio Bolognani & Andrea Censi & Florian Dörfler & Emilio Frazzoli, 2024. "A Self-Contained Karma Economy for the Dynamic Allocation of Common Resources," Dynamic Games and Applications, Springer, vol. 14(3), pages 578-610, July.
    3. Santiago R. Balseiro & Vahab Mirrokni & Renato Paes Leme & Song Zuo, 2022. "Dynamic Double Auctions: Toward First Best," Operations Research, INFORMS, vol. 70(4), pages 2299-2317, July.
    4. Shivam Gupta & Wei Chen & Milind Dawande & Ganesh Janakiraman, 2023. "Three Years, Two Papers, One Course Off: Optimal Nonmonetary Reward Policies," Management Science, INFORMS, vol. 69(5), pages 2852-2869, May.
    5. Combe, Julien & Nora, Vladyslav & Tercieux, Olivier, 2025. "Dynamic assignment without money: optimality of spot mechanisms," Theoretical Economics, Econometric Society, vol. 20(1), January.
    6. Moise Blanchard & Patrick Jaillet, 2024. "Near-Optimal Mechanisms for Resource Allocation Without Monetary Transfers," Papers 2408.10066, arXiv.org, revised Aug 2026.
    7. Artur Gorokh & Siddhartha Banerjee & Krishnamurthy Iyer, 2021. "From Monetary to Nonmonetary Mechanism Design via Artificial Currencies," Mathematics of Operations Research, INFORMS, vol. 46(3), pages 835-855, August.
    8. , H. & ,, 2016. "Approximate efficiency in repeated games with side-payments and correlated signals," Theoretical Economics, Econometric Society, vol. 11(1), January.
    9. Shivam Gupta & Saurabh Bansal & Milind Dawande & Ganesh Janakiraman, 2024. "Trust-and-Evaluate: A Dynamic Nonmonetary Mechanism for Internal Capital Allocation," Management Science, INFORMS, vol. 70(11), pages 7811-7828, November.
    10. Aristotelis Boukouras & Kostas Koufopoulos, 2017. "Efficient allocations in economies with asymmetric information when the realized frequency of types is common knowledge," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 64(1), pages 75-98, June.
    11. Vahideh Manshadi & Rad Niazadeh & Scott Rodilitz, 2023. "Fair Dynamic Rationing," Management Science, INFORMS, vol. 69(11), pages 6818-6836, November.
    12. Aristotelis Boukouras & Kostas Koufopoulos, 2015. "Efficient Allocations in Economies with Asymmetric Information when the Realized Frequency of Types is Common Knowledge," Discussion Papers in Economics 15/04, Division of Economics, School of Business, University of Leicester.
    13. MohammadHossein Bateni & Yiwei Chen & Dragos Florin Ciocan & Vahab Mirrokni, 2022. "Fair Resource Allocation in a Volatile Marketplace," Operations Research, INFORMS, vol. 70(1), pages 288-308, January.
    14. Jerry Anunrojwong & Krishnamurthy Iyer & Vahideh Manshadi, 2023. "Information Design for Congested Social Services: Optimal Need-Based Persuasion," Management Science, INFORMS, vol. 69(7), pages 3778-3796, July.
    15. Dirk Bergemann & Marek Bojko & Paul DŸtting & Renato Paes Leme & Haifeng Xu & Song Zuo, 2024. "Data-Driven Mechanism Design: Jointly Eliciting Preferences and Information," Cowles Foundation Discussion Papers 2418, Cowles Foundation for Research in Economics, Yale University.
    16. Th`anh Nguyen & Alexander Teytelboym & Shai Vardi, 2023. "Dynamic Combinatorial Assignment," Papers 2303.13967, arXiv.org.
    17. Hitoshi Matsushima & Shunya Noda, 2020. "Mechanism Design with Blockchain Enforcement," DSSR Discussion Papers 111, Graduate School of Economics and Management, Tohoku University.
    18. Ciamac C. Moallemi & Utkarsh Patange, 2024. "Hybrid Scheduling with Mixed-Integer Programming at Columbia Business School," Interfaces, INFORMS, vol. 54(3), pages 222-240, May.
    19. Stefano Galavotti, 2014. "Reducing Inefficiency in Public Good Provision Through Linking," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 16(3), pages 427-466, June.
    20. Max Simchowitz & Aleksandrs Slivkins, 2024. "Exploration and Incentives in Reinforcement Learning," Operations Research, INFORMS, vol. 72(3), pages 983-998, May.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    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:2609.05499. 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: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.