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...
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...
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...
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...
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...