Task Assignment with Autonomous and Controlled Agents
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.
|Date of creation:||Sep 2011|
|Contact details of provider:|| Web page: http://www.iset.ge/|
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Crawford, Vincent P & Knoer, Elsie Marie, 1981. "Job Matching with Heterogeneous Firms and Workers," Econometrica, Econometric Society, vol. 49(2), pages 437-450, March.
- Roth, Alvin E. & Sotomayor, Marilda, 1992.
Handbook of Game Theory with Economic Applications,
in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 16, pages 485-541
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zaier Aouani)
If references are entirely missing, you can add them using this form.