The impact of altruism on the efficiency of atomic congestion games

Authors:
Ioannis Caragiannis;Christos Kaklamanis;Panagiotis Kanellopoulos;Maria Kyropoulou;Evi Papaioannou
Affiliations:
Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece
Venue:
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Year:
2010

Citing 11
Cited 6

Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Price of Routing Unsplittable Flow

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Selfish Load Balancing and Atomic Congestion Games

Algorithmica
Altruism, selfishness, and spite in traffic routing

Proceedings of the 9th ACM conference on Electronic commerce
A new model for selfish routing

Theoretical Computer Science
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Cost-balancing tolls for atomic network congestion games

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Taxes for linear atomic congestion games

ACM Transactions on Algorithms (TALG)
Exact price of anarchy for polynomial congestion games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Tight bounds for selfish and greedy load balancing

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Spatial distribution of connection weight in self-repairing network

KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part IV
Adaptive strategies: toward a design of adaptive systems for dynamic environments

Proceedings of the International Conference on Management of Emergent Digital EcoSystems
The robust price of anarchy of altruistic games

WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Selfishness level of strategic games

SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Social context in potential games

WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Altruism in Atomic Congestion Games

ACM Transactions on Economics and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the effect of combining selfishness and altruism in atomic congestion games. We allow players to be partially altruistic and partially selfish and determine the impact of this behavior on the overall system performance. Surprisingly, our results indicate that, in general, by allowing players to be (even partially) altruistic, the overall system performance deteriorates. Instead, for the class of symmetric load balancing games, a balance between selfish and altruistic behavior improves system performance to optimality.