Sciweavers

344 search results - page 50 / 69
» Banach-Mazur Games on Graphs
Sort
View
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
13 years 10 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
ISCAPDCS
2004
13 years 10 months ago
Distributed Algorithms for DCOP: A Graphical-Game-Based Approach
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Ta...
TCS
2008
13 years 8 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
APVIS
2004
13 years 10 months ago
Graph Interaction through Force-Based Skeletal Animation
Skeletal animation is a concept that has been used in the areas of motion pictures and computer games to create realistic motion for the animation of articulated characters. Recen...
Colin Murray, Damian Merrick, Masahiro Takatsuka
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
14 years 3 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad