Group action graphs and parallel architectures
SIAM Journal on Computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third 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
AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the core of the multicommodity flow game
Proceedings of the 4th ACM conference on Electronic commerce
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
The price of selfish behavior in bilateral network formation
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
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Strategic Network Formation through Peering and Service Agreements
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
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
A fractional model of the border gateway protocol (BGP)
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A network creation game with nonuniform interests
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Competitive influence maximization in social networks
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Influential nodes in a diffusion model for social networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
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
RTG: a recursive realistic graph generator using random typing
Data Mining and Knowledge Discovery
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
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Contribution games in social networks
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
On approximate nash equilibria in network design
WINE'10 Proceedings of the 6th international conference on Internet and network economics
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
Bounded budget betweenness centrality game for strategic network formations
Theoretical Computer Science
Minimizing the diameter of a network using shortcut edges
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Bounded-Distance network creation games
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
On Nash Equilibria for a Network Creation Game
ACM Transactions on Economics and Computation
Hi-index | 0.00 |
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players or nodes each of whom has a budget for purchasing links; each link has a cost as well as a length and each node has a set of preference weights for each of the remaining nodes; the objective of each node is to use its budget to buy a set of outgoing links so as to minimize its sum of preference-weighted distances to the remaining nodes. We study the structural and complexity-theoretic properties of pure Nash equilibria in BBC games. We show that determining the existence of a pure Nash equilibrium in general BBC games is NP-hard. A major focus is the study of (n,k)-uniform BBC games - those in which all link costs, link lengths and preference weights are equal (to 1) and all budgets are equal (to k). We show that a pure Nash equilibrium or stable graph exists for all (n,k)-uniform BBC games and that all stable graphs are essentially fair (i.e. all nodes have similar costs). We provide an explicit construction of a family of stable graphs that spans the spectrum from minimum total social cost to maximum total social cost. To be precise we show that that the price of stability is Θ(1) and the price of anarchy is Ω(√n/k / logk n) and O(√n/logk n). We analyze best-response walks on the configuration space defined by the uniform game, and show that starting from any initial configuration, strong connectivity is reached within n2 rounds. We demonstrate that convergence to a pure Nash equilibrium is not guaranteed by demonstrating the existence of an explicit loop which also proves that even uniform BBC games are not potential games. Lastly, we extend our results to the case where each node seeks to minimize its maximum distance to the other nodes.