Achieving network optima using Stackelberg routing strategies
IEEE/ACM Transactions on Networking (TON)
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Computing Minimum-Weight Perfect Matchings
INFORMS Journal on Computing
Stackelberg Scheduling Strategies
SIAM Journal on Computing
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Utilitarian resource assignment
Journal of Discrete Algorithms
Equilibria for networks with malicious users
Mathematical Programming: Series A and B
Algorithmic Game Theory
Altruism, selfishness, and spite in traffic routing
Proceedings of the 9th ACM conference on Electronic commerce
On the impact of combinatorial structure on congestion games
Journal of the ACM (JACM)
Theoretical Computer Science
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science
Coordination mechanisms for selfish scheduling
Theoretical Computer Science
Theoretical Computer Science
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Stability and Convergence in Selfish Scheduling with Altruistic Agents
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Stackelberg Strategies for Atomic Congestion Games
Theory of Computing Systems - Special Section: Algorithmic Game Theory; Guest Editors: Burkhard Monien and Ulf-Peter Schroeder
Computing Nash Equilibria for Scheduling on Restricted Parallel Links
Theory of Computing Systems
Tradeoffs and Average-Case Equilibria in Selfish Routing
ACM Transactions on Computation Theory (TOCT)
The impact of altruism on the efficiency of atomic congestion games
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Routing (un-) splittable flow in games with player-specific affine latency functions
ACM Transactions on Algorithms (TALG)
Non-clairvoyant Scheduling Games
Theory of Computing Systems - Special Issue: Algorithmic Game Theory
The robust price of anarchy of altruistic games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Computer Science Review
Hi-index | 0.00 |
This article studies the effects of altruism, a phenomenon widely observed in practice, in the model of atomic congestion games. Altruistic behavior is modeled by a linear trade-off between selfish and social objectives. Our model can be embedded in the framework of congestion games with player-specific latency functions. Stable states are the pure Nash equilibria of these games, and we examine their existence and the convergence of sequential best-response dynamics. In general, pure Nash equilibria are often absent, and existence is NP-hard to decide. Perhaps surprisingly, if all delay functions are affine, the games remain potential games, even when agents are arbitrarily altruistic. The construction underlying this result can be extended to a class of general potential games and social cost functions, and we study a number of prominent examples. These results give important insights into the robustness of multi-agent systems with heterogeneous altruistic incentives. Furthermore, they yield a general technique to prove that stabilization is robust, even with partly altruistic agents, which is of independent interest. In addition to these results for uncoordinated dynamics, we consider a scenario with a central altruistic institution that can set incentives for the agents. We provide constructive and hardness results for finding the minimum number of altruists to stabilize an optimal congestion profile and more general mechanisms to incentivize agents to adopt favorable behavior. These results are closely related to Stackelberg routing and answer open questions raised recently in the literature.