Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third 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
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
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
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
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
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
Strategic network formation with structural holes
Proceedings of the 9th ACM conference on Electronic commerce
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
The Price of Anarchy of a Network Creation Game with Exponential Payoff
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Local Two-Stage Myopic Dynamics for Network Formation 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
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Analysis of user-driven peer selection in peer-to-peer backup and storage systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
EGOIST: overlay routing using selfish neighbor selection
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Symbiotic relationships in internet routing overlays
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Selfish Neighbor Selection in Peer-to-Peer Backup and Storage Applications
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Uncoordinated peer selection in P2P backup and storage applications
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
A network formation game approach to study bittorrent tit-for-tat
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
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
On cooperative and efficient overlay network evolution based on a group selection pattern
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On cooperative and efficient overlay network evolution based on a group selection pattern
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
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
On approximate nash equilibria in network design
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
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
Network formation in the presence of contagious risk
Proceedings of the 12th ACM conference on Electronic commerce
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
Towards network games with social preferences
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Selfish overlay network creation and maintenance
IEEE/ACM Transactions on Networking (TON)
Behavior-based reputation management in P2P file-sharing networks
Journal of Computer and System Sciences
ACM SIGMETRICS Performance Evaluation Review
Capacitated network design games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On dynamics in selfish network creation
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
On Nash Equilibria for a Network Creation Game
ACM Transactions on Economics and Computation
| Hi-index | 0.00 |
Given a collection of selfish agents who wish to establish links to route traffic among themselves, the set of equilibrium network topologies may appear quite different from the centrally enforced optimum. We study the quality (price of anarchy) of equilibrium networks in a game where links require the consent of both participants and are negotiated bilaterally and compare these networks to those generated by an earlier model due to Fabrikant et al. [6] in which links are formed unilaterally. We provide a characterization of stable and efficient networks in the bilateral network formation game, show that the set of stable networks is richer than those in the unilateral game, and that all stable networks of the unilateral game are also stable in the bilateral game. We also provide an upper and lower bound on the price of anarchy (tight in the size of the network n but not the link cost α) of the bilateral game and show that the worst-case price of anarchy of the bilateral model is worse than for the unilateral model. A careful empirical analysis demonstrates that the average price of anarchy is better in the bilateral connection game than in the unilateral game for small link costs but worse as links become more expensive. In the process, a powerful equivalence between link-based graph stability and two game-theoretic equilibrium notions is also discussed. The equivalence establishes necessary and sufficient conditions for an equilibrium in the bilateral game that helps provide a partial geometric characterization of equilibrium graphs.