STOC '04 Proceedings of the thirty-sixth 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
The price of selfish behavior in bilateral network formation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A network pricing game for selfish traffic
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Beyond VCG: Frugality of Truthful Mechanisms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Bottleneck links, variable demand, and the tragedy of the commons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New trade-offs in cost-sharing mechanisms
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Welfare maximization in congestion games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Non-cooperative multicast and facility location games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Network design with weighted players
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
A study of Nash equilibrium in contribution games for peer-to-peer networks
ACM SIGOPS Operating Systems Review
Competition and Efficiency in Congested Markets
Mathematics of Operations Research
On the convergence of multicast games in directed networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Strong equilibrium in cost sharing connection games
Proceedings of the 8th ACM conference on Electronic commerce
Distributed network monitoring and multicommodity flows: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
The price of anarchy in network creation games
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Network formation games with local coalitions
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Game authority for robust andscalable distributed selfish-computer systems
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
On cost sharing mechanisms in the network design game
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A network formation game for bipartite exchange economies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Maximum-lifetime routing: system optimization & game-theoretic perspectives
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
On the value of coordination in network design
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Mechanism design for sensor fusion: tactical networks as a foil for ultra large scale systems
Proceedings of the 2nd international workshop on Ultra-large-scale software-intensive systems
Online multicast with egalitarian cost sharing
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Cost sharing mechanisms for near-optimal traffic aggregation and network design
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Computing correlated equilibria in multi-player games
Journal of the ACM (JACM)
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
When Ignorance Helps: Graphical Multicast Cost Sharing Games
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On the impact of combinatorial structure on congestion games
Journal of the ACM (JACM)
Approximate Strong Equilibrium in Job Scheduling Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Price of Anarchy of a Network Creation Game with Exponential Payoff
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Local and Global Price of Anarchy of Graphical Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Non-cooperative Cost Sharing Games Via Subsidies
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Improved equilibria via public service advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Conflicting Congestion Effects in Resource Allocation Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Local Two-Stage Myopic Dynamics for Network Formation Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Network Formation and Routing by Strategic Agents Using Local Contracts
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Three Selfish Spanning Tree Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On Pure and (Approximate) Strong Equilibria of Facility Location Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On the Equilibria and Efficiency of the GSP Mechanism in Keyword Auctions with Externalities
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Cooperation in Multiorganization Matching
Approximation and Online Algorithms
$\mathcal{NP}$-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
On a locally minimum cost forwarding game
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
An O( lognloglogn) upper bound on the price of stability for undirected Shapley network design games
Information Processing Letters
The price of democracy in coalition formation
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Pricing traffic in a spanning network
Proceedings of the 10th ACM conference on Electronic commerce
Proceedings of the 10th ACM conference on Electronic commerce
The price of anarchy in bertrand games
Proceedings of the 10th ACM conference on Electronic commerce
Strong and Pareto Price of Anarchy in Congestion Games
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
Mechanism design for set cover games with selfish element agents
Theoretical Computer Science
The price of stability in selfish scheduling games
Web Intelligence and Agent Systems
When ignorance helps: Graphical multicast cost sharing games
Theoretical Computer Science
Correlated evolutionarily stable strategies in random medium access control
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
A constrained evolutionary Gaussian multiple access channel game
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Characterizing the Existence of Potential Functions in Weighted Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Anarchy, Stability, and Utopia: Creating Better Matchings
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Price of Stability in Survivable Network Design
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On Equilibria for ADM Minimization Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Approximate Pure Nash Equilibria via Lovász Local Lemma
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Maximizing the Minimum Load: The Cost of Selfishness
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
The Impact of Social Ignorance on Weighted Congestion Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the Inefficiency Ratio of Stable Equilibria in Congestion Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A dynamic random access game with energy constraints
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Quality-based resource brokerage for autonomous networked multimedia applications
IEEE Transactions on Circuits and Systems for Video Technology
Approximate strong equilibrium in job scheduling games
Journal of Artificial Intelligence Research
The hardness of selective network design for bottleneck routing games
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Information security economics - and beyond
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Nash equilibria in Voronoi games on graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The price of nash equilibria in multicast transmissions games
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A unified approach to congestion games and two-sided markets
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the performance of congestion games for optimum satisfiability problems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
A network creation game with nonuniform interests
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the complexity of pure Nash equilibria in player-specific network congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Game authority for robust and scalable distributed selfish-computer systems
Theoretical Computer Science
Optimal placement of ad-hoc devices under a VCG-style routing protocol
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Multi-commodity source location problems and price of greed
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
On the social cost of distributed selfish content replication
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Competitive cost sharing with economies of scale
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Computing pure strategy nash equilibria in compact symmetric games
Proceedings of the 11th ACM conference on Electronic commerce
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Proceedings of the 11th ACM conference on Electronic commerce
Better vaccination strategies for better people
Proceedings of the 11th ACM conference on Electronic commerce
Socially-aware network design games
INFOCOM'10 Proceedings of the 29th conference on Information communications
An efficient Nash-implementation mechanism for network resource allocation
Automatica (Journal of IFAC)
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Price war in heterogeneous wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Colocation games: and their application to distributed resource management
HotCloud'09 Proceedings of the 2009 conference on Hot topics in cloud computing
Taxes for linear atomic congestion games
ACM Transactions on Algorithms (TALG)
A network formation model for internet transit relations
Proceedings of the 2010 Workshop on Economics of Networks, Systems, and Computation
On the existence of pure nash equilibria inweighted congestion games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Pareto efficiency and approximate pareto efficiency in routing and load balancing games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
A game theoretic analysis of network design with socially-aware users
Computer Networks: The International Journal of Computer and Telecommunications Networking
The efficiency of fair division with connected pieces
WINE'10 Proceedings of the 6th international conference on Internet and network economics
The complexity of equilibria in cost sharing games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Local and global price of anarchy of graphical games
Theoretical Computer Science
Extending the notion of rationality of selfish agents: Second Order Nash equilibria
Theoretical Computer Science
The price of anarchy in cooperative network creation games
ACM SIGecom Exchanges
Leading dynamics to good behavior
ACM SIGecom Exchanges
A Nash bargaining solution for cooperative network formation games
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Congestion games with failures
Discrete Applied Mathematics
Optimal gateway selection in multi-domain wireless networks: a potential game perspective
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
On the complexity of pure-strategy nash equilibria in congestion and local-effect games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Strong and correlated strong equilibria in monotone congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Selfish service installation in networks
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Wardrop equilibria and price of stability for bottleneck games with splittable traffic
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Atomic routing games on maximum congestion
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
On the price of anarchy and stability of correlated equilibria of linear congestion games,,
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Geometric network design with selfish agents
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Atomic selfish routing in networks: a survey
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Autonomous Agents and Multi-Agent Systems
On the price of stability for designing undirected networks with fair cost allocations
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The price of approximate stability for scheduling selfish tasks on two links
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A game theoretical study of access point association in wireless mesh networks
Computer Communications
The max k-cut game and its strong equilibria
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
The price of anarchy in network creation games
ACM Transactions on Algorithms (TALG)
Equilibria for broadcast range assignment games in ad-hoc networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
On the price of stability for undirected network design
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Non-cooperative facility location and covering games
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the impact of local taxes in a set cover game
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Towards network games with social preferences
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
On the power of nodes of degree four in the local max-cut problem
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The snowball effect of uncertainty in potential games
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
Survey: Robust and scalable middleware for selfish-computer systems
Computer Science Review
Conflicting Congestion Effects in Resource Allocation Games
Operations Research
Contention issues in congestion games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Cooperation in multi-organization scheduling
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Extending the notion of rationality of selfish agents: second order Nash equilibria
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Strong price of anarchy for machine load balancing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Selfishness level of strategic games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Basic network creation games with communication interests
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Capacitated network design games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
The price of anarchy for selfish ring routing is two
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Convergence of best-response dynamics in games with conflicting congestion effects
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Future Generation Computer Systems
Improved bounds on the price of stability in network cost sharing games
Proceedings of the fourteenth ACM conference on Electronic commerce
A study on the stability and efficiency of graphical games with unbounded treewidth
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
ACM Transactions on Economics and Computation
On the structure of equilibria in basic network formation
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Invitation games and the price of stability
Proceedings of the 5th conference on Innovations in theoretical computer science
User satisfaction in competitive sponsored search
Proceedings of the 23rd international conference on World wide web
Theory of Computing Systems
Hi-index | 0.04 |
Network design is a fundamental problem for which it is important to understand the effects of strategic behavior. Given a collection of selfinterested agents who want to form a network connecting certain endpoints, the set of stable solutions 驴 the Nash equilibria 驴 may look quite different from the centrally enforced optimum. We study the quality of the best Nash equilibrium, and refer to the ratio of its cost to the optimum network cost as the price of stability. The best Nash equilibrium solution has a natural meaning of stability in this context 驴 it is the optimal solution that can be proposed from which no user will "defect". We consider the price of stability for network design with respect to one of the most widely-studied protocols for network cost allocation, in which the cost of each edge is divided equally between users whose connections make use of it; this fair-division scheme can be derived from the Shapley value, and has a number of basic economic motivations. We show that the price of stability for network design with respect to this fair cost allocation is O(log k), where k is the number of users, and that a good Nash equilibrium can be achieved via best-response dynamics in which users iteratively defect from a starting solution. This establishes that the fair cost allocation protocol is in fact a useful mechanism for inducing strategic behavior to form near-optimal equilibria. We discuss connections to the class of potential games defined by Monderer and Shapley, and extend our results to cases in which users are seeking to balance network design costs with latencies in the constructed network, with stronger results when the network has only delays and no construction costs. We also present bounds on the convergence time of best-response dynamics, and discuss extensions to a weighted game.