IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v88y2014icp29-46.html
   My bibliography  Save this article

Fair by design: Multidimensional envy-free mechanisms

Author

Listed:
  • Mu'alem, Ahuva

Abstract

We address the common scenario where a group of agents wants to divide a set of items fairly, and at the same time seeks to optimize a global goal. Suppose that each item is a task and we want to find an allocation that minimizes the completion time of the last task in an envy-free manner, where no agent prefers anyone else's allocated task bundle over its own. This optimization goal is called makespan minimization, and the agents are often treated as machines. We give tight deterministic bounds for: (1) two unrelated machines; and (2) m≥2 related machines.

Suggested Citation

  • Mu'alem, Ahuva, 2014. "Fair by design: Multidimensional envy-free mechanisms," Games and Economic Behavior, Elsevier, vol. 88(C), pages 29-46.
    • Handle: RePEc:eee:gamebe:v:88:y:2014:i:c:p:29-46
    DOI: 10.1016/j.geb.2014.08.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825614001171
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2014.08.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Claus-Jochen Haake & Matthias G. Raith & Francis Edward Su, 2002. "Bidding for envy-freeness: A procedural approach to n-player fair-division problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 19(4), pages 723-749.
    2. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
    3. Nisan, Noam & Ronen, Amir, 2001. "Algorithmic Mechanism Design," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 166-196, April.
    4. Demange, Gabrielle & Gale, David, 1985. "The Strategy Structure of Two-sided Matching Markets," Econometrica, Econometric Society, vol. 53(4), pages 873-888, July.
    5. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    6. Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
    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. Mu'alem, Ahuva & Schapira, Michael, 2018. "Setting lower bounds on truthfulness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 174-193.

    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. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    2. 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, Osaka University.
    3. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," Journal of Economic Theory, Elsevier, vol. 188(C).
    4. Babaioff, Moshe & Blumrosen, Liad & Schapira, Michael, 2013. "The communication burden of payment determination," Games and Economic Behavior, Elsevier, vol. 77(1), pages 153-167.
    5. Nisan, Noam, 2015. "Algorithmic Mechanism Design," Handbook of Game Theory with Economic Applications,, Elsevier.
    6. Mu'alem, Ahuva & Schapira, Michael, 2018. "Setting lower bounds on truthfulness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 174-193.
    7. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object allocation: Ex-post revenue maximization with no wastage," Working Papers e116, Tokyo Center for Economic Research.
    8. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," Discussion Papers 17-03, Indian Statistical Institute, Delhi.
    9. Yuya Wakabayashi & Ryosuke Sakai & Shigehiro Serizawa, 2022. "A Characterization of the Minimum Price Walrasian Rule with Reserve Prices for an Arbitrary Number of Agents and Objects," ISER Discussion Paper 1161, Institute of Social and Economic Research, Osaka University.
    10. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    11. Wei He & Jiangtao Li & Weijie Zhong, 2024. "Rank-Guaranteed Auctions," Papers 2408.12001, arXiv.org.
    12. Frank Kelly & Peter Key & Neil Walton, 2016. "Efficient Advert Assignment," Operations Research, INFORMS, vol. 64(4), pages 822-837, August.
    13. Ming Chen & Sareh Nabi & Marciano Siniscalchi, 2023. "Advancing Ad Auction Realism: Practical Insights & Modeling Implications," Papers 2307.11732, arXiv.org, revised Apr 2024.
    14. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    15. Mahsa Derakhshan & Negin Golrezaei & Renato Paes Leme, 2022. "Linear Program-Based Approximation for Personalized Reserve Prices," Management Science, INFORMS, vol. 68(3), pages 1849-1864, March.
    16. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Mechanism design without quasilinearity," Theoretical Economics, Econometric Society, vol. 15(2), May.
    17. 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.
    18. Sameer Mehta & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2020. "Sustaining a Good Impression: Mechanisms for Selling Partitioned Impressions at Ad Exchanges," Information Systems Research, INFORMS, vol. 31(1), pages 126-147, March.
    19. 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.
    20. Axel Ockenfels & David Reiley & Abdolkarim Sadrieh, 2006. "Online Auctions," NBER Working Papers 12785, National Bureau of Economic Research, Inc.

    More about this item

    Keywords

    Envy-free allocations; Optimization; Profit maximization; Mechanism design;
    All these keywords.

    JEL classification:

    • D02 - Microeconomics - - General - - - Institutions: Design, Formation, Operations, and Impact
    • D40 - Microeconomics - - Market Structure, Pricing, and Design - - - General
    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    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:eee:gamebe:v:88:y:2014:i:c:p:29-46. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.