Sciweavers

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

11

MFCS
2004
Springer

favoriteEmaildiscussreport

75views Theoretical Computer Science» more MFCS 2004»

When Can You Play Positionally?

13 years 10 months ago

When Can You Play Positionally?

Download www.liafa.jussieu.fr

We consider inﬁnite antagonistic games over ﬁnite graphs. We present conditions that, whenever satisﬁed by the payoﬀ mapping, assure for both players positional (memoryless) optimal strategies. To verify the robustness of our conditions we show that all popular payoﬀ mappings, such as mean payoﬀ, discounted, parity as well as several other payoﬀs satisfy them.

Hugo Gimbert, Wieslaw Zielonka

Real-time Traffic

Inﬁnite Antagonistic Games | MFCS 2004 | Payoﬀ Mappings | Popular Payoﬀ Mappings |

claim paper

Related Content

» Games Where You Can Play Optimally Without Any Memory

» When Online Reviews Meet Hyperdifferentiation A Study of Craft Beer Industry

» Can you see what i hear the design and evaluation of a peripheral sound display for the de...

» When Random Play is Optimal Against an Adversary

» Cooperating Physical Robots A Lesson in Playing Robotic Soccer

» The impact of YouTube recommendation system on video views

» You Share I Share Network Effects and Economic Incentives in P2P FileSharing Systems

» Can PeertoPeer Networks Facilitate Information Sharing in Collaborative Learning

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	MFCS
Authors	Hugo Gimbert, Wieslaw Zielonka

Comments (0)