Sciweavers

134 search results - page 10 / 27
» On the Complexity of Computing Values of Restricted Games
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
ICGA
2006
128views Optimization» more  ICGA 2006»
13 years 7 months ago
Never-Ending Moves in Bao
Bao is a member of the large family of mancala games. It is generally considered to be the most complex mancala game with respect to the number of game rules (Townshend, 1986; De ...
Tom Kronenburg, H. H. L. M. Donkers, Alex J. de Vo...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 12 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
MFCS
2010
Springer
13 years 6 months ago
Proof Systems and Transformation Games
We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
Yoram Bachrach, Michael Zuckerman, Michael Wooldri...
ATAL
2009
Springer
14 years 2 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...