Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Selfish traffic allocation for server farms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Group Strategyproof Mechanisms via Primal-Dual Algorithms
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Selfish Routing in Capacitated Networks
Mathematics of Operations Research
The price of selfish behavior in bilateral network formation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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 framework for incentive compatible topology control in non-cooperative wireless multi-hop networks
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
The price of anarchy in network creation games
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
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Impact of Asynchrony on the Behavior of Rational Selfish Agents
Fundamenta Informaticae
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
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
Improved equilibria via public service advertising
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
Network Creation Games with Disconnected Equilibria
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Large human communication networks: patterns and a utility-driven generator
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Resource Management in Large Networks
Algorithmics of Large and Complex Networks
Characterizing the Existence of Potential Functions in Weighted Congestion Games
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
Approximate strong equilibrium in job scheduling games
Journal of Artificial Intelligence Research
Who should pay for forwarding packets?
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
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
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: the price of anarchy for distributed network formation in an adversary model
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Constructing traffic-aware overlay topologies: a machine learning approach
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Analysis of large multi-modal social networks: patterns and a generator
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
The price of anarchy in network creation games is (mostly) constant
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Near-strong equilibria in network creation games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Strategic multiway cut and multicut games
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
The price of anarchy in cooperative network creation games
ACM SIGecom Exchanges
On a bounded budget network creation game
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Dynamic inefficiency: anarchy without stability
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
A clustering coefficient network formation game
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
On dynamics in basic network creation games
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Bounded budget betweenness centrality game for strategic network formations
Theoretical Computer Science
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The price of anarchy in network creation games
ACM Transactions on Algorithms (TALG)
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Minimizing the diameter of a network using shortcut edges
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Towards network games with social preferences
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Behavioral experiments on a network formation game
Proceedings of the 13th ACM Conference on Electronic Commerce
Conflicting Congestion Effects in Resource Allocation Games
Operations Research
Impact of Asynchrony on the Behavior of Rational Selfish Agents
Fundamenta Informaticae
Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games
MFCS'12 Proceedings of the 37th 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
Basic network creation games with communication interests
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Bounded-Distance network creation games
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Greedy selfish network creation
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
On dynamics in selfish network creation
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
On the structure of equilibria in basic network formation
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
We study a network creation game recently proposed by Fabrikant, Luthra, Maneva, Papadimitriou and Shenker. In this game, each player (vertex) can create links (edges) to other players at a cost of α per edge. The goal of every player is to minimize the sum consisting of (a) the cost of the links he has created and (b) the sum of the distances to all other players.Fabrikant et al. conjectured that there exists a constant A such that, for any α A, all non-transient Nash equilibria graphs are trees. They showed that if a Nash equilibrium is a tree, the price of anarchy is constant. In this paper we disprove the tree conjecture. More precisely, we show that for any positive integer n0, there exists a graph built by n ≥ n0 players which contains cycles and forms a non-transient Nash equilibrium, for any α with 1 n/2. Our construction makes use of some interesting results on finite affine planes. On the other hand we show that, for α ≥ 12n[log n], every Nash equilibrium forms a tree.Without relying on the tree conjecture, Fabrikant et al. proved an upper bound on the price of anarchy of O(√α), where α ∈ [2, n2]. We improve this bound. Specifically, we derive a constant upper bound for α ∈ O(√n) and for α ≥ 12n[log n]. For the intermediate values we derive an improved bound of O(1 + (min{α2/n, n2/α})1/3).Additionally, we develop characterizations of Nash equilibria and extend our results to a weighted network creation game as well as to scenarios with cost sharing.