Abstract
In many situations a player may act so as to maximize a perceived utility that is not exactly her utility function, but rather some other, biased, utility. Examples of such biased utility functions are common in behavioral economics, and include risk attitudes, altruism, present-bias and so on. When analyzing a game, one may ask how inefficiency, measured by the Price of Anarchy (PoA) is a?ected by the perceived utilities.
The smoothness method [16, 15] naturally extends to games with such perceived utilities or costs, regardless of the game or the behavioral bias. We show that such biasedsmoothness is broadly applicable in the context of nonatomic congestion games. First, we show that on series-parallel networks we can use smoothness to yield PoA bounds even for diverse populations with di?erent biases. Second, we identify various classes of cost functions and biases that are smooth, thereby substantially improving some recent results from the literature.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On the Intrinsic Fragility of the Price of Anarchy;IEEE Control Systems Letters;2023
2. On Poisoned Wardrop Equilibrium in Congestion Games;Lecture Notes in Computer Science;2023
3. Providing Slowdown Information to Improve Selfish Routing;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2022
4. Coordination Mechanisms with Misinformation;Proceedings of the 14th International Conference on Agents and Artificial Intelligence;2022
5. Mission Level Uncertainty in Multi-Agent Resource Allocation;2021 60th IEEE Conference on Decision and Control (CDC);2021-12-14