Network games

Authors:
Éva Tardos
Affiliations:
Cornell University, Ithaca, NY
Venue:
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Year:
2004

Citing 25
Cited 10

Sharing the “cost” of multicast trees: an axiomatic analysis

IEEE/ACM Transactions on Networking (TON)
Algorithmic mechanism design (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
How bad is selfish routing?

Journal of the ACM (JACM)
On the complexity of equilibria

STOC '02 Proceedings of the thiry-fourth 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
Tight bounds for worst-case equilibria

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Frugal path mechanisms

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
A BGP-based mechanism for lowest-cost routing

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
On a network creation game

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Vickrey Prices and Shortest Paths: What is an Edge Worth?

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The price of anarchy is independent of the network topology

Journal of Computer and System Sciences - STOC 2002
Auction algorithms for market equilibrium

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
Selfish load balancing and atomic congestion games

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Efficiency Loss in a Network Resource Allocation Game

Mathematics of Operations Research
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
Selfish Routing in Capacitated Networks

Mathematics of Operations Research
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Query Incentive Networks

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Distributed social systems

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Social networks, incentives, and search

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Cheap labor can be expensive

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Price of Stability in Survivable Network Design

SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Two-group knapsack game

Theoretical Computer Science
A semantical approach to equilibria and rationality

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Query incentive networks

ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Truthful approximation mechanisms for scheduling selfish related machines

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Designing cooperative IS: exploring and evaluating alternatives

ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network games approach some of the traditional algorithmic questions in networks from the perspective of game theory, which gives rise of a wide range of interesting issues. In this talk we will give an overview of recent progress in many of these areas, and show strong ties to certain algorithmic techniques.