Corpus ID: 15775790

Making Games Short

@inproceedings{Feige2006MakingGS,
  title={Making Games Short},
  author={U. Feige and Joe KilianyAbstractWe},
  year={2006}
}

U. Feige, Joe KilianyAbstractWe

Published 2006

We study the complexity of refereed games, in which two computationally unlimited players play against each other, and a polynomial time referee monitors the game and announces the winner. The players may exchange messages with the referee in private, resulting in a game of perfect recall but incomplete information. We show that any EXPTIME statement can be eeciently transformed into a refereed game in which if the statement is true, the rst player wins with overwhelming probability , and if… CONTINUE READING

Save to Library

Create Alert

Cite

Launch Research Feed