Antisocial Agents and Vickrey Auctions
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
Stackelberg Scheduling Strategies
SIAM Journal on Computing
The maximum latency of selfish routing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Free-riding and whitewashing in peer-to-peer systems
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
An Antisocial Strategy for Scheduling Mechanisms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Selfish routing with atomic players
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Linear tolls suffice: new bounds and algorithms for tolls in single source networks
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
How much can taxes help selfish routing?
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Stackelberg thresholds in network routing games or the value of altruism
Proceedings of the 8th ACM conference on Electronic commerce
Congestion games with malicious players
Proceedings of the 8th ACM conference on Electronic commerce
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The effectiveness of Stackelberg strategies and tolls for network congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Outperforming the competition in multi-unit sealed bid auctions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Spiteful bidding in sealed-bid auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Cooperative or vindictive: bidding strategies in sponsored search auction
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Braess's paradox, fibonacci numbers, and exponential inapproximability
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Network games with atomic players
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Impact of altruism on opportunistic communications
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
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
Selfishness, altruism and message spreading in mobile social networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Altruistic task allocation despite unbalanced relationships within multi-robot communities
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Better vaccination strategies for better people
Proceedings of the 11th ACM conference on Electronic commerce
Stackelberg Routing in Arbitrary Networks
Mathematics of Operations Research
The impact of altruism on the efficiency of atomic congestion games
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
An adaptive control technique for a connection weight of agents in a self-repairing network
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
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
A strategy distribution of a self-repairing network in dynamic environments
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Adaptive strategies: toward a design of adaptive systems for dynamic environments
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Adversarial behavior in network mechanism design
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
A systemic payoff in a self-repairing network
Artificial Life and Robotics
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
Selfishness level of strategic games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Approaching utopia: strong truthfulness and externality-resistant mechanisms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
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
Hi-index | 0.00 |
In this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the "cost" perceived by a user is a linear combination of the actual latency of the route chosen (selfish component), and the increase in latency the user causes for others (altruistic component). We show that if all users have a coefficient of at least β 0 for the altruistic component, then the price of anarchy is bounded by 1/β, for all network topologies, arbitrary commodities, and arbitrary semi-convex latency functions. We extend this result to give more precise bounds on the price of anarchy for specific classes of latency functions, even for β 2). We next study non-uniform altruism distributions, where different users may have different coefficients β. We prove that all such games, even with infinitely many types of players, have a Nash Equilibrium. We show that if the average of the coefficients for the altruistic components of all users is β, then the price of anarchy is bounded by 1/β, for single commodity parallel link networks, and arbitrary convex latency functions. In particular, this result generalizes, albeit non-constructively, the Stackelberg routing results of Roughgarden and of Swamy. More generally, we bound the price of anarchy based on the class of allowable latency functions, and as a corollary obtain tighter bounds for Stackelberg routing than a recent result of Swamy.