Advanced Search
MyIDEAS: Login to save this paper or follow this series

Task Assignment with Autonomous and Controlled Agents

Contents:

Author Info

  • 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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://www.iset.ge/files/wp_04-11_flrorian_biermann.pdf
Download Restriction: no

Bibliographic Info

Paper provided by International School of Economics at TSU, Tbilisi, Republic of Georgia in its series Working Papers with number 004-11.

as in new window
Length: 20 pages
Date of creation: Sep 2011
Date of revision:
Handle: RePEc:tbs:wpaper:11-004

Contact details of provider:
Web page: http://www.iset.ge/
More information through EDIRC

Related research

Keywords:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
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.:
as in new window
  1. Crawford, Vincent P & Knoer, Elsie Marie, 1981. "Job Matching with Heterogeneous Firms and Workers," Econometrica, Econometric Society, vol. 49(2), pages 437-50, March.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

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 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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.