We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
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...