Incentive Design in a Distributed Problem with Strategic Agents
Donya Ghavidel, Pratyush Chakraborty, Enrique Baeyens, Vijay Gupta,, and Pramod P. Khargonekar

TL;DR
This paper develops an incentive scheme for distributed systems with strategic, self-interested agents, addressing the challenge of aligning individual incentives with a centralized objective without assuming full knowledge of agents' costs or their anticipation of incentives.
Contribution
It introduces a novel incentive rule that bridges mechanism design and cost allocation, relaxing common assumptions and analyzing property satisfaction under various conditions.
Findings
Proposed incentive scheme satisfies several desirable properties.
Analyzed the impact of relaxing assumptions on incentive properties.
Bridged gap between mechanism design and cost allocation approaches.
Abstract
In this paper, we consider a general distributed system with multiple agents who select and then implement actions in the system. The system has an operator with a centralized objective. The agents, on the other hand, are selfinterested and strategic in the sense that each agent optimizes its own individual objective. The operator aims to mitigate this misalignment by designing an incentive scheme for the agents. The problem is difficult due to the cost functions of the agents being coupled, the objective of the operator not being social welfare, and the operator having no direct control over actions being implemented by the agents. This problem has been studied in many fields, particularly in mechanism design and cost allocation. However, mechanism design typically assumes that the operator has knowledge of the cost functions of the agents and the actions being implemented by the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
