IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2406.00147.html
   My bibliography  Save this paper

Fair Allocation in Dynamic Mechanism Design

Author

Listed:
  • Alireza Fallah
  • Michael I. Jordan
  • Annie Ulichney

Abstract

We consider a dynamic mechanism design problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a fairness constraint that guarantees a minimum average allocation for each group. We begin by studying the static case ($T=1$) and establish that the optimal mechanism involves two types of subsidization: one that increases the overall probability of allocation to all buyers, and another that favors the groups which otherwise have a lower probability of winning the item. We then extend our results to the dynamic case by characterizing a set of recursive functions that determine the optimal allocation and payments in each round. Notably, our results establish that in the dynamic case, the seller, on the one hand, commits to a participation bonus to incentivize truth-telling, and on the other hand, charges an entry fee for every round. Moreover, the optimal allocation once more involves subsidization, which its extent depends on the difference in future utilities for both the seller and buyers when allocating the item to one group versus the others. Finally, we present an approximation scheme to solve the recursive equations and determine an approximately optimal and fair allocation efficiently.

Suggested Citation

  • Alireza Fallah & Michael I. Jordan & Annie Ulichney, 2024. "Fair Allocation in Dynamic Mechanism Design," Papers 2406.00147, arXiv.org, revised Oct 2024.
  • Handle: RePEc:arx:papers:2406.00147
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Susan Athey & Dominic Coey & Jonathan Levin, 2013. "Set-Asides and Subsidies in Auctions," American Economic Journal: Microeconomics, American Economic Association, vol. 5(1), pages 1-27, February.
    2. Piotr Dworczak & Scott Duke Kominers & Mohammad Akbarpour, 2021. "Redistribution Through Markets," Econometrica, Econometric Society, vol. 89(4), pages 1665-1698, July.
    3. Takuo Sugaya & Alexander Wolitzky, 2021. "The Revelation Principle in Multistage Games [Information Feedback in a Dynamic Tournament]," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 88(3), pages 1503-1540.
    4. Dirk Bergemann & Juuso Välimäki, 2019. "Dynamic Mechanism Design: An Introduction," Journal of Economic Literature, American Economic Association, vol. 57(2), pages 235-274, June.
    5. Elena Krasnokutskaya & Katja Seim, 2011. "Bid Preference Programs and Participation in Highway Procurement Auctions," American Economic Review, American Economic Association, vol. 101(6), pages 2653-2686, October.
    6. Mohammad Akbarpour & Eric Budish & Piotr Dworczak & Scott Duke Kominers, 2024. "An Economic Framework for Vaccine Prioritization," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 139(1), pages 359-417.
    7. Mallesh Pai & Rakesh Vohra, 2012. "Auction Design with Fairness Concerns: Subsidies vs. Set-Asides," Discussion Papers 1548, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    8. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
    9. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    10. Alessandro Pavan & Ilya Segal & Juuso Toikka, 2014. "Dynamic Mechanism Design: A Myersonian Approach," Econometrica, Econometric Society, vol. 82(2), pages 601-653, March.
    11. Pai, Mallesh M. & Vohra, Rakesh, 2014. "Optimal auctions with financially constrained buyers," Journal of Economic Theory, Elsevier, vol. 150(C), pages 383-425.
    12. Myerson, Roger B, 1986. "Multistage Games with Communication," Econometrica, Econometric Society, vol. 54(2), pages 323-358, March.
    13. Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ruiqin Wang & Cagil Kocyigit & Napat Rujeerapaiboon, 2025. "Equitable Auction Design: With and Without Distributions," Papers 2502.08369, arXiv.org.

    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. Piotr Dworczak & Scott Duke Kominers & Mohammad Akbarpour, 2021. "Redistribution Through Markets," Econometrica, Econometric Society, vol. 89(4), pages 1665-1698, July.
    2. Papadimitriou, Christos & Pierrakos, George & Psomas, Alexandros & Rubinstein, Aviad, 2022. "On the complexity of dynamic mechanism design," Games and Economic Behavior, Elsevier, vol. 134(C), pages 399-427.
    3. Arve, Malin & Zwart, Gijsbert, 2023. "Optimal procurement and investment in new technologies under uncertainty," Journal of Economic Dynamics and Control, Elsevier, vol. 147(C).
    4. Arve, Malin, 2014. "Procurement and predation: Dynamic sourcing from financially constrained suppliers," Journal of Public Economics, Elsevier, vol. 120(C), pages 157-168.
    5. Jehiel, Philippe & Lamy, Laurent, 2014. "On discrimination in procurement auctions," CEPR Discussion Papers 9790, C.E.P.R. Discussion Papers.
    6. Dominic Coey & Bradley Larsen & Kane Sweeney, 2019. "The bidder exclusion effect," RAND Journal of Economics, RAND Corporation, vol. 50(1), pages 93-120, March.
    7. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Mechanism design without quasilinearity," Theoretical Economics, Econometric Society, vol. 15(2), May.
    8. Bernhardt, Dan & Liu, Tingjun & Sogo, Takeharu, 2020. "Costly auction entry, royalty payments, and the optimality of asymmetric designs," Journal of Economic Theory, Elsevier, vol. 188(C).
    9. Kotowski, Maciej H., 2018. "On asymmetric reserve prices," Theoretical Economics, Econometric Society, vol. 13(1), January.
    10. Philippe Jehiel & Laurent Lamy, 2020. "On the Benefits of Set-Asides," Journal of the European Economic Association, European Economic Association, vol. 18(4), pages 1655-1696.
    11. Condorelli, Daniele, 2013. "Market and non-market mechanisms for the optimal allocation of scarce resources," Games and Economic Behavior, Elsevier, vol. 82(C), pages 582-591.
    12. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    13. Pham, Hien, 2023. "How Information Design Shapes Optimal Selling Mechanisms," MPRA Paper 120989, University Library of Munich, Germany, revised 06 Mar 2024.
    14. José Alcalde & Matthias Dahm, "undated". "Supplier Diversity before the Time of Cholera," Discussion Papers in Economics 20/07, Division of Economics, School of Business, University of Leicester.
    15. Subhasish M. Chowdhury & Patricia Esteve‐González & Anwesha Mukherjee, 2023. "Heterogeneity, leveling the playing field, and affirmative action in contests," Southern Economic Journal, John Wiley & Sons, vol. 89(3), pages 924-974, January.
    16. Barbosa, Klenio & Boyer, Pierre C., 2021. "Discrimination in Dynamic Procurement Design with Learning-by-doing," International Journal of Industrial Organization, Elsevier, vol. 77(C).
    17. Bergemann, Dirk & Strack, Philipp, 2022. "Progressive participation," Theoretical Economics, Econometric Society, vol. 17(3), July.
    18. Hitoshi Matsushima, 2021. "Auctions with Ethical Concerns," CARF F-Series CARF-F-515, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    19. Skreta, Vasiliki & Doval, Laura, 2021. "Purchase history and product personalization," CEPR Discussion Papers 15969, C.E.P.R. Discussion Papers.
    20. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," ISER Discussion Paper 1001, Institute of Social and Economic Research, The University of Osaka.

    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:2406.00147. 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: http://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.