Computing Game Values for Crash Games

  title={Computing Game Values for Crash Games},
  author={Thomas Gawlitza and Helmut Seidl},
We consider crash games which are a generalization of parity games in which the play value of a play is an integer, −∞ or ∞. In particular, the play value of a finite play is given as the sum of the payoffs of t he moves of the play. Accordingly, one player aims at maximizing the pla y v lue whereas the other player aims at minimizing this value. We show that t e game value of such a crash game at position v, i.e., the least upper bounds to the minimal play value that can be enforced by the… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 18 references

Polynomial Exact Interval Analysis Revisited

  • Thomas Gawlitza, Jan Reineke, Helmut Seidl, Reinhard Wilhelm
  • Technical report, TU Münche n,
  • 2006
1 Excerpt

Easterbrook , and Arie Gurfinkel . Multi - valued symbolic modelchecking

  • Marsha Chechik, Benet Devereux, M. Steve
  • LICS , pages 178 – 187 . IEEE Computer Society
  • 2005

urdzinski. Mean-payoff parity games. InLICS, pages 178–187

  • Krishnendu Chatterjee, Thomas A. Henzinger, J Marcin
  • IEEE Computer Society,
  • 2005
1 Excerpt

The Controlled Linear Programming Problem

  • Henrik Jrklund, Olle Nilsson, Ola Svensson, Sergei V orobyov
  • Technical report,
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…