research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:chita
TitleProbabilistic Techniques in Algorithmic Game Theory
Bibtex cite IDRACTI-RU1-2007-41
Booktitle 4th Symposium on Stochastic Algorithms, Foundations, and Applications (SAGA 2007)
Year published 2007
Month September
Pages 30-53
Publisher Springer - Verlag Berlin Heidelberg 2007
Organization SAGA 2007
Location Zürich
Note (SAGA 2007 Invited Paper)
Keywords Game Theory,Atomic Congestion Games,Coalitions,Convergence
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.
Kontogiannis, Spyros
Spirakis, Paul
saga07survey.pdf (main file)
Publication ID95