Sciweavers

14084 search results - page 93 / 2817
» A Theory for Game Theories
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 6 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
CCGRID
2007
IEEE
14 years 2 months ago
Fair Game-Theoretic Resource Management in Dedicated Grids
We study two problems directly resulting from organizational decentralization of the Grid. Firstly, the problem of fair scheduling in systems in which the grid scheduler has compl...
Krzysztof Rzadca, Denis Trystram, Adam Wierzbicki
ATAL
2007
Springer
14 years 2 months ago
Reinforcement learning in extensive form games with incomplete information: the bargaining case study
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
Alessandro Lazaric, Jose Enrique Munoz de Cote, Ni...
EPIA
2005
Springer
14 years 1 months ago
Intentions and Strategies in Game-Like Scenarios
In this paper, we investigate the link between logics of games and “mentalistic” logics of rational agency, in which agents are characterized in terms of attitudes such as beli...
Wojciech Jamroga, Wiebe van der Hoek, Michael Wool...
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 9 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...