This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements....
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...