Sciweavers

1884 search results - page 1 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
TIME
2009
IEEE
13 years 11 months ago
Simple Algorithm for Simple Timed Games
Yasmina Abdeddaïm, Eugene Asarin, Mihaela Sig...
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 8 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
EOR
2011
140views more  EOR 2011»
12 years 11 months ago
Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
Stefan Bolus
JGAA
2007
123views more  JGAA 2007»
13 years 4 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
13 years 9 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...