Sciweavers

399 search results - page 9 / 80
» Games with Congestion-Averse Utilities
Sort
View
ATAL
2006
Springer
14 years 1 months ago
A technique for reducing normal-form games to compute a Nash equilibrium
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
Vincent Conitzer, Tuomas Sandholm
ECAI
2006
Springer
14 years 1 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
ADHOC
2010
217views more  ADHOC 2010»
13 years 9 months ago
Multiplayer games over Vehicular Ad Hoc Networks: A new application
In this paper we investigate the possibility of a new type of application, namely multiplayer games, in a Vehicular Ad Hoc Network (VANET) environment. First, we analyze the avail...
Ozan K. Tonguz, Mate Boban
AMAI
2004
Springer
13 years 9 months ago
Representing von Neumann-Morgenstern Games in the Situation Calculus
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...
Oliver Schulte, James P. Delgrande
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
13 years 8 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani