Probabilistic techniques in algorithmic game theory

Authors:
Spyros C. Kontogiannis;Paul G. Spirakis
Affiliations:
Computer Science Department, University of Ioannina, Ioannina, Greece and Research Academic Computer Technology Institute, Greece;Research Academic Computer Technology Institute, Greece
Venue:
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Year:
2007

Citing 16
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Tail bounds for occupancy and the satisfiability threshold conjecture

Random Structures & Algorithms
Balls and bins: a study in negative dependence

Random Structures & Algorithms
How bad is selfish routing?

Journal of the ACM (JACM)
Playing large games using simple strategies

Proceedings of the 4th ACM conference on Electronic commerce
The complexity of pure Nash equilibria

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The Price of Routing Unsplittable Flow

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing Nash Equilibria: Approximation and Smoothed Complexity

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Polynomial algorithms for approximating nash equilibria of bimatrix games

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
A note on approximate nash equilibria

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Symmetry in network congestion games: pure equilibria and anarchy cost

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Atomic congestion games among coalitions

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Well supported approximate equilibria in bimatrix games: a graph theoretic approach

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic method to demonstrate the existence of approximate Nash equilibria of logarithmic support sizes in bimatrix games; (ii) the analysis of the statistical conflict that mixed strategies cause in network congestion games; (iii) the effect of coalitions in the quality of congestion games on parallel links.