Introduction to algorithms
Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
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
Trading networks with price-setting agents
Proceedings of the 8th 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
Price Variation in a Bipartite Exchange Network
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Large human communication networks: patterns and a utility-driven generator
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
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
The networked common goods game
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Price stabilization in networks: what is an appropriate model?
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
A clustering coefficient network formation game
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Behavioral experiments on a network formation game
Proceedings of the 13th ACM Conference on Electronic Commerce
| Hi-index | 0.00 |
We introduce a natural new network formation game in which buyers and sellers may purchase edges representing trading opportunities between themselves, and then accrue wealth in the resulting exchange economy. Our main result is an exact characterization of the set of bipartite graphs G that are Nash equilibria for this game. This characterization provides sharp limits on the amount and structure of wealth variation that can occur, as well as on the allowable equilibrium exchange rates.