Sciweavers

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

10

AAIM
2006
Springer

favoriteEmaildiscussreport

94views Algorithms» more AAIM 2006»

Linear Programming Polytope and Algorithm for Mean Payoff Games

13 years 8 months ago

Linear Programming Polytope and Algorithm for Mean Payoff Games

Download www.dbai.tuwien.ac.at

We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated algorithm solving a linear program and transforming its solution into a solution of the game.

Ola Svensson, Sergei G. Vorobyov

Real-time Traffic

AAIM 2006 | Algorithms | Mean Payoff Games | Tight Feasible Solutions |

claim paper

Related Content

» How to solve large scale deterministic games with mean payoff by policy iteration

» A Distributed Algorithm for Finding NucleolusStable Payoff Divisions

» Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games

» EMMA A novel Evaluation Metric for Morphological Analysis

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	AAIM
Authors	Ola Svensson, Sergei G. Vorobyov

Comments (0)