Name
Title | ||
|---|---|---|
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. |
Abstract | ||
|---|---|---|
We consider two-player zero-sum stochastic mean payoff games with perfect information. We show that any such game, with a constant number of random positions and polynomially bounded positive transition probabilities, admits a polynomial time approximation scheme, both in the relative and absolute sense. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s00453-017-0372-7 | Algorithmica |
Keywords | Field | DocType |
Stochastic mean payoff games,Approximation schemes,Approximation algorithms,Nash equilibrium | Approximation algorithm,Discrete mathematics,Combinatorics,Nash equilibrium,Perfect information,Traveler's dilemma,Mathematics,Polynomial-time approximation scheme,Bounded function,Stochastic game | Journal |
Volume | Issue | ISSN |
80 | 11 | 0178-4617 |
Citations | PageRank | References |
0 | 0.34 | 22 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Endre Boros | 1 | 1779 | 155.63 |
| Khaled M. Elbassioni | 2 | 287 | 42.96 |
| Mahmoud Fouz | 3 | 226 | 13.16 |
| Vladimir Gurvich | 4 | 688 | 68.89 |
| Kazuhisa Makino | 5 | 1088 | 102.74 |
| Bodo Manthey | 6 | 147 | 13.30 |