Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

86

Voted

STACS
2007
Springer

114views Theoretical Computer Science» more STACS 2007»

Admissibility in Infinite Games

15 years 9 months ago

Admissibility in Infinite Games

Download www-i7.informatik.rwth-aachen.de

Dietmar Berwanger

Real-time Traffic

STACS 2007 | Theoretical Computer Science |

claim paper

Related Content

» FiniteState Strategies in Regular Infinite Games

» Mechanical Reasoning on Infinite Extensive Games

» Positional Determinacy of Games with Infinitely Many Priorities

» Computing BestResponse Strategies in Infinite Games of Incomplete Information

» A Survey of Stochastic Games with Limsup and Liminf Objectives

» Analysis of LoadBalanced Switch with Finite Buffers

» Emerging coordination in infinite team Markov games

» Infinite trace equivalence

» Stochastic Games with Lossy Channels

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	STACS
Authors	Dietmar Berwanger

Comments (0)