Sciweavers

344 search results - page 47 / 69
» Banach-Mazur Games on Graphs
Sort
View
LICS
2008
IEEE
14 years 3 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 10 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
EJC
2007
13 years 8 months ago
Bart-Moe games, JumbleG and discrepancy
Let A and B be hypergraphs with a common vertex set V . In a (p, q, A ∪ B) Bart-Moe game, the players take turns selecting previously unclaimed vertices of V . The game ends whe...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 8 months ago
Strategy Improvement for Concurrent Safety Games
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
JUCS
2007
105views more  JUCS 2007»
13 years 8 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran