.png){kind=icon}
.png){kind=icon}
Return
Adaptive Incentive Design
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2020.3027503.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We apply control theoretic and optimization techniques to adaptively design incentives for principal-agent problems in which the principal faces adverse selection in its interaction with multiple agents. In particular, the principal's objective depends on data from strategic decision makers (agents) whose decision-making process is unknown a priori. We consider both the cases where agents play best response to one another (Nash) and where they employ myopic update rules. By parametrizing the agents' utility functions and the incentives offered, we develop an algorithm that the principal can employ to learn the agents' decision-making processes while simultaneously designing incentives to change their response to one that is more desirable. We provide convergence results for this algorithm both in the noise-free and noisy cases and present illustrative examples.
Keywords:
Games
Nash equilibrium
Control theory
Optimization
Convergence
Noise measurement
Adaptive algorithms
game theory
incentive design
multiagent systems
optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W