TY - GEN
T1 - A game-theoretic approach to a task delegation problem
AU - Dobakhshari, Donya G.
AU - Varshney, Lav R.
AU - Gupta, Vijay
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - We study a setting in which a principal selects an agent to execute a collection of tasks according to a specified priority sequence. Agents, however, have their own individual priority sequences according to which they wish to execute the tasks. There is information asymmetry since each priority sequence is private knowledge for the individual agent. We design a mechanism for selecting the agent and incentivizing the selected agent to realize a priority sequence for executing the tasks that achieves socially optimal performance. Our proposed mechanism consists of two parts. First, the principal runs an auction to select an agent to allocate tasks to with minimum declared priority sequence misalignment. Then, the principal rewards the agent according to the realized priority sequence with which the tasks were performed. We show that the proposed mechanism is individually rational and incentive compatible. Further, it is also socially optimal for the case of linear cost of priority sequence modification for the agents.
AB - We study a setting in which a principal selects an agent to execute a collection of tasks according to a specified priority sequence. Agents, however, have their own individual priority sequences according to which they wish to execute the tasks. There is information asymmetry since each priority sequence is private knowledge for the individual agent. We design a mechanism for selecting the agent and incentivizing the selected agent to realize a priority sequence for executing the tasks that achieves socially optimal performance. Our proposed mechanism consists of two parts. First, the principal runs an auction to select an agent to allocate tasks to with minimum declared priority sequence misalignment. Then, the principal rewards the agent according to the realized priority sequence with which the tasks were performed. We show that the proposed mechanism is individually rational and incentive compatible. Further, it is also socially optimal for the case of linear cost of priority sequence modification for the agents.
UR - http://www.scopus.com/inward/record.url?scp=85050985867&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050985867&partnerID=8YFLogxK
U2 - 10.1109/ACSSC.2017.8335557
DO - 10.1109/ACSSC.2017.8335557
M3 - Conference contribution
AN - SCOPUS:85050985867
T3 - Conference Record of 51st Asilomar Conference on Signals, Systems and Computers, ACSSC 2017
SP - 1271
EP - 1276
BT - Conference Record of 51st Asilomar Conference on Signals, Systems and Computers, ACSSC 2017
A2 - Matthews, Michael B.
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 51st Asilomar Conference on Signals, Systems and Computers, ACSSC 2017
Y2 - 29 October 2017 through 1 November 2017
ER -