On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Selfish routing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Near rationality and competitive equilibria in networked systems
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
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
Overcoming free-riding behavior in peer-to-peer systems
ACM SIGecom Exchanges
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
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
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
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
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
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
Energy-efficient algorithms for flow time minimization
ACM Transactions on Algorithms (TALG)
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
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A game-theoretic analysis of wireless access point selection by mobile users
Computer Communications
On the windfall of friendship: inoculation strategies on social networks
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
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
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
Network Creation Games with Disconnected Equilibria
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 graph-based characteristics of optimal overlay topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
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
EGOIST: overlay routing using selfish neighbor selection
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Large human communication networks: patterns and a utility-driven generator
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
The price of anarchy in bertrand games
Proceedings of the 10th ACM conference on Electronic commerce
Efficiency of Scalar-Parameterized Mechanisms
Operations Research
RTG: a recursive realistic graph generator using random typing
Data Mining and Knowledge Discovery
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
RTG: A Recursive Realistic Graph Generator Using Random Typing
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
A recall-based cluster formation game in peer-to-peer systems
Proceedings of the VLDB Endowment
Price of Stability in Survivable Network Design
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Theoretical Computer Science
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation
Theoretical Computer Science
Uncoordinated peer selection in P2P backup and storage applications
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Approximate strong equilibrium in job scheduling games
Journal of Artificial Intelligence Research
Non-cooperative facility location and covering games
Theoretical Computer Science
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
Optimal topology design for overlay networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Information security economics - and beyond
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Mechanism design by creditability
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Who should pay for forwarding packets?
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Incentive-compatible interdomain routing with linear utilities
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
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
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
Contribution games in social networks
ESA'10 Proceedings of the 18th annual European conference on Algorithms: 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
On approximate nash equilibria in network design
WINE'10 Proceedings of the 6th international conference on Internet and network economics
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
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
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
Fast track article: Peer-to-peer overlay topology control for mobile ad hoc networks
Pervasive and Mobile Computing
A game theoretic framework for peer-to-peer market economy
International Journal of Grid and Utility Computing
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
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Bounded budget betweenness centrality game for strategic network formations
Theoretical Computer Science
Brief announcement: composition games for distributed systems: the EU grants games
DISC'11 Proceedings of the 25th international conference on Distributed computing
Selfish service installation in networks
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Frontiers of Computer Science in China
Energy-Efficient algorithms for flow time minimization
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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
Multicast transmissions in non-cooperative networks with a limited number of selfish moves
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On nash equilibria in non-cooperative all-optical networks
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On nash equilibria for multicast transmissions in ad-hoc wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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)
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
On the cost of participating in a peer-to-peer network
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Towards network games with social preferences
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Strategic formation of credit networks
Proceedings of the 21st international conference on World Wide Web
Behavioral experiments on a network formation game
Proceedings of the 13th ACM Conference on Electronic Commerce
Cache me if you can: capacitated selfish replication games
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A novel dynamic pricing scheme for contributing peers in the VoD system
Multimedia Tools and Applications
Brief announcement: network formation games can give rise to realistic networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Conflicting Congestion Effects in Resource Allocation Games
Operations Research
Scaling simulation-based game analysis through deviation-preserving reduction
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Selfish overlay network creation and maintenance
IEEE/ACM Transactions on Networking (TON)
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
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
ACM SIGMETRICS Performance Evaluation Review
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
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
The max-distance network creation game on general host graphs
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Naturality of Network Creation Games, Measurement and Analysis
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
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
On Nash Equilibria for a Network Creation Game
ACM Transactions on Economics and Computation
On the Windfall and price of friendship: Inoculation strategies on social networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We introduce a novel game that models the creation of Internet-like networks by selfish node-agents without central design or coordination. Nodes pay for the links that they establish, and benefit from short paths to all destinations. We study the Nash equilibria of this game, and prove results suggesting that the "price of anarchy" [4] in this context (the relative cost of the lack of coordination) may be modest. Several interesting: extensions are suggested.