We show the undecidability of whether a team has a forced win in a number of well known video games including: Team Fortress 2, Super Smash Brothers: Brawl, and Mario Kart.To do so, we give a simplification of the Team Computation Game [Hearn and Demaine, 2009] and use that to give an undecidable abstract game on graphs. This graph game framework better captures the geometry and common constraints in many games and is thus a powerful tool for showing their computational complexity
AbstractWe present a number of two-person games, based on simple combinatorial ideas, for which the ...
Abstract. We analyse the computational complexity of finding Nash equilibria in simple stochastic mu...
In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games ...
There is a fundamental connection between the notions of game and of computation. At its most basic ...
AbstractExtending the complexity results of Reif [1,2] for two player games of incomplete informatio...
AbstractWe introduce an alternative concept to determine the solvability of two-player games with pe...
International audienceWe present some basics of game theory, focusing on matrix games. We then prese...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
International audienceIn this talk, I will show how one can characterize and compute Nash equilibria...
We introduce a very complex game based on an approximate solution of a NP-hard problem, so that the ...
Graph Games is a suite of online casual games that make use of human computation to help solve sever...
Today, as computer systems are ubiquitous in our everyday life, there is no need to argue that their...
We present a general construction for eliminating imperfect information from games with several play...
Magic: The Gathering is a popular and famously complicated trading card game about magical combat. I...
We study the game Greedy Spiders, a two-player strategic defense game, on planar graphs and show PSP...
AbstractWe present a number of two-person games, based on simple combinatorial ideas, for which the ...
Abstract. We analyse the computational complexity of finding Nash equilibria in simple stochastic mu...
In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games ...
There is a fundamental connection between the notions of game and of computation. At its most basic ...
AbstractExtending the complexity results of Reif [1,2] for two player games of incomplete informatio...
AbstractWe introduce an alternative concept to determine the solvability of two-player games with pe...
International audienceWe present some basics of game theory, focusing on matrix games. We then prese...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
International audienceIn this talk, I will show how one can characterize and compute Nash equilibria...
We introduce a very complex game based on an approximate solution of a NP-hard problem, so that the ...
Graph Games is a suite of online casual games that make use of human computation to help solve sever...
Today, as computer systems are ubiquitous in our everyday life, there is no need to argue that their...
We present a general construction for eliminating imperfect information from games with several play...
Magic: The Gathering is a popular and famously complicated trading card game about magical combat. I...
We study the game Greedy Spiders, a two-player strategic defense game, on planar graphs and show PSP...
AbstractWe present a number of two-person games, based on simple combinatorial ideas, for which the ...
Abstract. We analyse the computational complexity of finding Nash equilibria in simple stochastic mu...
In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games ...