Sciweavers

9 search results - page 2 / 2
» A constructive approach to sequential Nash equilibria
Sort
View
MFCS
2007
Springer
13 years 11 months ago
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
Spyros C. Kontogiannis, Paul G. Spirakis
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
13 years 11 months ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
AMAI
2004
Springer
13 years 11 months ago
A Framework for Sequential Planning in Multi-Agent Settings
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state spac...
Piotr J. Gmytrasiewicz, Prashant Doshi
ATAL
2008
Springer
13 years 7 months ago
Self-interested database managers playing the view maintenance game
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a v...
Hala Mostafa, Victor R. Lesser, Gerome Miklau