Altruism, selfishness, and spite in traffic routing
Proceedings of the 9th ACM conference on Electronic commerce
On the windfall of friendship: inoculation strategies on social networks
Proceedings of the 9th ACM conference on Electronic commerce
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Bayesian Auctions with Friends and Foes
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Stability and Convergence in Selfish Scheduling with Altruistic Agents
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Socially-aware network design games
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the existence of pure nash equilibria inweighted congestion games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The impact of altruism on the efficiency of atomic congestion games
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
Characterizing the Existence of Potential Functions in Weighted Congestion Games
Theory of Computing Systems - Special Issue: Algorithmic Game Theory
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The robust price of anarchy of altruistic games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Selfishness level of strategic games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
| Hi-index | 0.00 |
A prevalent assumption in game theory is that all players act in a purely selfish manner, but this assumption has been repeatedly questioned by economists and social scientists. In this paper, we study a model that allows to incorporate the social context of players into their decision making. We consider the impact of other-regarding preferences in potential games, one of the most popular and central classes of games in algorithmic game theory. Our results concern the existence of pure Nash equilibria and potential functions in games with social context. The main finding is a tight characterization of the class of potential games that admit exact potential functions for any social context. In addition, we prove complexity results on deciding existence of pure Nash equilibria in numerous popular classes of potential games, such as different classes of load balancing, congestion, cost and market sharing games.