When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Making greed work in networks: a game-theoretic analysis of switch service disciplines
IEEE/ACM Transactions on Networking (TON)
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Stackelberg scheduling strategies
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Selfish traffic allocation for server farms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The price of anarchy is independent of the network topology
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
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
On the performance of user equilibria in traffic networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Equilibria in topology control games for ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the expected payment of mechanisms for task allocation
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Energy efficient communication in ad hoc networks from user's and designer's perspective
ACM SIGMOBILE Mobile Computing and Communications Review
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
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
Equilibria in topology control games for ad hoc networks
Mobile Networks and Applications
Network design with weighted players
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
Strong equilibrium in cost sharing connection games
Proceedings of the 8th ACM conference on Electronic commerce
Stability in the self-organized evolution of networks
Proceedings of the 9th annual conference on Genetic and evolutionary computation
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
On cost sharing mechanisms in the network design game
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
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
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
Selfishness, collusion and power of local search for the ADMs minimization problem
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cost sharing mechanisms for near-optimal traffic aggregation and network design
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On Satisfiability Games and the Power of Congestion Games
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
When Ignorance Helps: Graphical Multicast Cost Sharing Games
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
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
Homogeneous Interference Game in Wireless Networks
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
$\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
The price of anarchy in bertrand games
Proceedings of the 10th ACM conference on Electronic commerce
Atomic routing games on maximum congestion
Theoretical Computer Science
Efficiency of Scalar-Parameterized Mechanisms
Operations Research
On the Performances of Nash Equilibria in Isolation Games
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
When ignorance helps: Graphical multicast cost sharing games
Theoretical Computer Science
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
An agent-based model for the evolution of the internet ecosystem
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Theoretical Computer Science
Approximate strong equilibrium in job scheduling games
Journal of Artificial Intelligence Research
Information security economics - and beyond
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Tradeoffs and average-case equilibria in selfish routing
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
Network formation: bilateral contracting and myopic dynamics
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
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
Selfishness, collusion and power of local search for the ADMs minimization problem
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
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
Socially-aware network design games
INFOCOM'10 Proceedings of the 29th conference on Information communications
Constructing traffic-aware overlay topologies: a machine learning approach
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Promotion of selfish agents in hierarchical organisations
COIN'09 Proceedings of the 5th international conference on Coordination, organizations, institutions, and norms in agent systems
The Internet is flat: modeling the transition from a transit hierarchy to a peering mesh
Proceedings of the 6th International COnference
A game theoretic analysis of network design with socially-aware users
Computer Networks: The International Journal of Computer and Telecommunications Networking
Strategic multiway cut and multicut games
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
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
Network formation in the presence of contagious risk
Proceedings of the 12th ACM conference on Electronic commerce
On the performances of Nash equilibria in isolation games
Journal of Combinatorial Optimization
Dynamic inefficiency: anarchy without stability
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
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
Atomic routing games on maximum congestion
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Braess's paradox, fibonacci numbers, and exponential inapproximability
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
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
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Congestion games, load balancing, and price of anarchy
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
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
Non-cooperative facility location and covering games
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Journal of Network and Computer Applications
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
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
Bounded-Distance network creation games
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Network Formation in the Presence of Contagious Risk
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games
Theoretical Computer Science
Non-cooperative games on multidimensional resource allocation
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
| Hi-index | 0.00 |
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requirement, i.e. each agent has a set of terminals and wants to build a network in which his terminals are connected. Possible edges in the network have costs and each agent's goal is to pay as little as possible. Determining whether or not a Nash equilibrium exists in this game is NP-complete. However, when the goal of each player is to connect a terminal to a common source, we prove that there is a Nash equilibrium as cheap as the optimal network, and give a polynomial time algorithm to find a (1+ε)-approximate Nash equilibrium that does not cost much more. For the general connection game we prove that there is a 3-approximate Nash equilibrium that is as cheap as the optimal network, and give an algorithm to find a (4.65+ε)-approximate Nash equilibrium that does not cost much more.