IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v71y2014icp116-121.html
   My bibliography  Save this article

Task assignment with controlled and autonomous agents

Author

Listed:
  • Biermann, Florian M.
  • Naroditskiy, Victor
  • Polukarov, Maria
  • Nguyen, Tri-Dung
  • Rogers, Alex
  • Jennings, Nicholas R.

Abstract

We analyse assignment problems in which not every agent is controlled by the central planner. The autonomous agents search for vacant tasks guided by their own preference orders over 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. Such optimisation problems arise in numerous real-world situations, ranging from organisational economics to “crowdsourcing” and disaster response. We show that the problem faced by the central planner can be transformed into a mixed integer bilevel optimisation problem. Then we demonstrate how this program can be reduced to a disjoint bilinear program, which is much more manageable computationally.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:matsoc:v:71:y:2014:i:c:p:116-121
    DOI: 10.1016/j.mathsocsci.2014.04.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489614000468
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2014.04.007?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. Crawford, Vincent P & Knoer, Elsie Marie, 1981. "Job Matching with Heterogeneous Firms and Workers," Econometrica, Econometric Society, vol. 49(2), pages 437-450, March.
    2. 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.
    3. Patrice Marcotte & Gilles Savard, 2005. "Bilevel Programming: A Combinatorial Perspective," Springer Books, in: David Avis & Alain Hertz & Odile Marcotte (ed.), Graph Theory and Combinatorial Optimization, chapter 0, pages 191-217, Springer.
    4. Alvin E. Roth & Uriel G. Rothblum & John H. Vande Vate, 1993. "Stable Matchings, Optimal Assignments, and Linear Programming," Mathematics of Operations Research, INFORMS, vol. 18(4), pages 803-828, November.
    5. 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. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press, vol. 33(4), pages 541-571.
    2. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    3. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    4. Roth, Alvin E., 1985. "Common and conflicting interests in two-sided matching markets," European Economic Review, Elsevier, vol. 27(1), pages 75-96, February.
    5. 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.
    6. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    7. Perez-Castrillo, David & Sotomayor, Marilda, 2002. "A Simple Selling and Buying Procedure," Journal of Economic Theory, Elsevier, vol. 103(2), pages 461-474, April.
    8. 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.
    9. 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.
    10. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    11. Blum, Yosef & Roth, Alvin E. & Rothblum, Uriel G., 1997. "Vacancy Chains and Equilibration in Senior-Level Labor Markets," Journal of Economic Theory, Elsevier, vol. 76(2), pages 362-411, October.
    12. Afacan, Mustafa Oǧuz, 2013. "Application fee manipulations in matching markets," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 446-453.
    13. Erdil, Aytek & Ergin, Haluk, 2017. "Two-sided matching with indifferences," Journal of Economic Theory, Elsevier, vol. 171(C), pages 268-292.
    14. Dimakopoulos, Philipp D. & Heller, C.-Philipp, 2018. "Matching with Waiting Times: The German Entry-Level Labor Market for Lawyers," Rationality and Competition Discussion Paper Series 68, CRC TRR 190 Rationality and Competition.
    15. Muriel Niederle, 2007. "Competitive Wages in a Match with Ordered Contracts," American Economic Review, American Economic Association, vol. 97(5), pages 1957-1969, December.
    16. Dimakopoulos, Philipp D. & Heller, C.-Philipp, 2019. "Matching with waiting times: The German entry-level labor market for lawyers," Games and Economic Behavior, Elsevier, vol. 115(C), pages 289-313.
    17. Yuichiro Kamada & Fuhito Kojima, 2020. "Accommodating various policy goals in matching with constraints," The Japanese Economic Review, Springer, vol. 71(1), pages 101-133, January.
    18. 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.
    19. Pérez-Castrillo, David & Sotomayor, Marilda, 2003. "A Selling Mechanism," Revista Brasileira de Economia - RBE, EPGE Brazilian School of Economics and Finance - FGV EPGE (Brazil), vol. 57(4), October.
    20. Jagadeesan, Ravi & Kominers, Scott Duke & Rheingans-Yoo, Ross, 2018. "Strategy-proofness of worker-optimal matching with continuously transferable utility," Games and Economic Behavior, Elsevier, vol. 108(C), pages 287-294.

    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:eee:matsoc:v:71:y:2014:i:c:p:116-121. 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/505565 .

    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.