Sciweavers

157 search results - page 2 / 32
» Totality in arena games
Sort
View
WINE
2007
Springer
128views Economy» more  WINE 2007»
13 years 11 months ago
Total Latency in Singleton Congestion Games
Abstract. In this work, we consider singleton congestion games as a special class of (weighted) congestion games where each players' strategy consists only of a single resourc...
Martin Gairing, Florian Schoppmann
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
13 years 12 months ago
Lion and man game in the presence of a circular obstacle
— In the lion and man game, a lion tries to capture a man who is as fast as the lion. We study a new version of this game which takes place in a Euclidean environment with a circ...
Nikhil Karnad, Volkan Isler
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 5 months ago
A parametric representation of totally mixed Nash equilibria
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
Gabriela Jeronimo, Daniel Perrucci, Juan Sabia
FSTTCS
2006
Springer
13 years 9 months ago
Game Semantics for Higher-Order Concurrency
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...
James Laird
FSTTCS
2008
Springer
13 years 6 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn