IDEAS home Printed from https://ideas.repec.org/p/tbs/wpaper/11-004.html

Task Assignment with Autonomous and Controlled Agents

Author

Listed:
  • Florian Biermann

    (International School of Economics at TSU, Tbilisi, Republic of Georgia)

  • Victor Naroditskiy

    (School of Electronics and Computer Science, University of Southampton, UK)

  • Maria Polukarov

    (School of Electronics and Computer Science, University of Southampton, UK)

  • Alex Rogers

    (School of Electronics and Computer Science, University of Southampton, UK)

  • Nicholas Jennings

    (School of Electronics and Computer Science, University of Southampton, UK)

Abstract

We analyse assignment problems in which not all agents are controlled by the central planner. The autonomous agents search for vacant tasks guided by their own preference orders defined over subsets of the available tasks. The goal of the central planner is to maximise the total value of the assignment, taking into account the behaviour of the uncontrolled agents. This setting can be found in numerous real-world situations, ranging from organisational economics to "crowdsourcing" and disaster response. We introduce the Disjunctively Constrained Knapsack Game and show that its unique Nash equilibrium reveals the optimal assignment for the controlled agents. This result allows us to find the solution of the problem using mathematical programming techniques.

Suggested Citation

  • Florian Biermann & Victor Naroditskiy & Maria Polukarov & Alex Rogers & Nicholas Jennings, 2011. "Task Assignment with Autonomous and Controlled Agents," Working Papers 004-11, International School of Economics at TSU, Tbilisi, Republic of Georgia.
    • Handle: RePEc:tbs:wpaper:11-004
    as

    Download full text from publisher

    File URL: http://www.iset.ge/files/wp_04-11_flrorian_biermann.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. J. Randall Brown, 1979. "The Sharing Problem," Operations Research, INFORMS, vol. 27(2), pages 324-340, April.
    2. Roth,Alvin E. & Sotomayor,Marilda A. Oliveira, 1992. "Two-Sided Matching," Cambridge Books, Cambridge University Press, number 9780521437882, January.
    3. Gigerenzer, Gerd & Todd, Peter M. & ABC Research Group,, 2000. "Simple Heuristics That Make Us Smart," OUP Catalogue, Oxford University Press, number 9780195143812.
    4. Crawford, Vincent P & Knoer, Elsie Marie, 1981. "Job Matching with Heterogeneous Firms and Workers," Econometrica, Econometric Society, vol. 49(2), pages 437-450, March.
    5. Martin J. Osborne & Ariel Rubinstein, 1994. "A Course in Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262650401, December.
    6. Gang Yu, 1996. "On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications," Operations Research, INFORMS, vol. 44(2), pages 407-415, April.
    7. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    8. J. Randall Brown, 1979. "The Knapsack Sharing Problem," Operations Research, INFORMS, vol. 27(2), pages 341-355, April.
    9. Alvin E. Roth, 1982. "The Economics of Matching: Stability and Incentives," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 617-628, 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. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    2. Perez-Castrillo, David & Sotomayor, Marilda, 2002. "A Simple Selling and Buying Procedure," Journal of Economic Theory, Elsevier, vol. 103(2), pages 461-474, April.
    3. Muriel Niederle, 2007. "Competitive Wages in a Match with Ordered Contracts," American Economic Review, American Economic Association, vol. 97(5), pages 1957-1969, December.
    4. Guillaume Haeringer & Myrna Wooders, 2011. "Decentralized job matching," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 1-28, February.
    5. Muriel Niederle & Alvin E. Roth, 2009. "The Effects of a Centralized Clearinghouse on Job Placement, Wages, and Hiring Practices," NBER Chapters, in: Studies of Labor Market Intermediation, pages 235-271, National Bureau of Economic Research, Inc.
    6. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    7. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    8. Biermann, Florian M. & Naroditskiy, Victor & Polukarov, Maria & Nguyen, Tri-Dung & Rogers, Alex & Jennings, Nicholas R., 2014. "Task assignment with controlled and autonomous agents," Mathematical Social Sciences, Elsevier, vol. 71(C), pages 116-121.
    9. Roth, Alvin E., 1985. "Common and conflicting interests in two-sided matching markets," European Economic Review, Elsevier, vol. 27(1), pages 75-96, February.
    10. Dutta, Bhaskar & Masso, Jordi, 1997. "Stability of Matchings When Individuals Have Preferences over Colleagues," Journal of Economic Theory, Elsevier, vol. 75(2), pages 464-475, August.
    11. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    12. Konishi, Hideo & Unver, M. Utku, 2006. "Credible group stability in many-to-many matching problems," Journal of Economic Theory, Elsevier, vol. 129(1), pages 57-80, July.
    13. Fuhito Kojima & Parag A. Pathak, 2009. "Incentives and Stability in Large Two-Sided Matching Markets," American Economic Review, American Economic Association, vol. 99(3), pages 608-627, June.
    14. Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
    15. Kovalenkov, Alexander & Wooders, Myrna Holtz, "undated". "A law of scarcity for games," Economic Research Papers 269297, University of Warwick - Department of Economics.
    16. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Levine's Bibliography 122247000000001022, UCLA Department of Economics.
    17. Ma, Jinpeng, 2010. "The singleton core in the college admissions problem and its application to the National Resident Matching Program (NRMP)," Games and Economic Behavior, Elsevier, vol. 69(1), pages 150-164, May.
    18. Muriel Niederle & Leeat Yariv, 2009. "Decentralized Matching with Aligned Preferences," NBER Working Papers 14840, National Bureau of Economic Research, Inc.
    19. Arnaud Dupuy & Alfred Galichon & Sonia Jaffe & Scott Duke Kominers, 2020. "Taxation In Matching Markets," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 61(4), pages 1591-1634, November.
    20. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).

    More about this item

    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:tbs:wpaper:11-004. 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: the person in charge The email address of this maintainer does not seem to be valid anymore. Please ask the person in charge to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/istsuge.html .

    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.