• Corpus ID: 18810444

Testing randomness by Matching Pennies

  title={Testing randomness by Matching Pennies},
  author={Dusko Pavlovic},
In the game of Matching Pennies, Alice and Bob each hold a penny, and at every tick of the clock they simultaneously display the head or the tail sides of their coins. If they both display the same side, then Alice wins Bob's penny; if they display different sides, then Bob wins Alice's penny. To avoid giving the opponent a chance to win, both players seem to have nothing else to do but to randomly play heads and tails with equal frequencies. However, while not losing in this game is easy, not… 

Tables from this paper


Sequential Equilibrium in Computational Games
This work examines sequential equilibrium in the context of computational games, where agents are charged for computation, and considers two notions of sequential equilibrium, an ex ante notion and an interim notion, where a player can reconsider at each information set whether he is doing the “right” thing, and if not, can change his strategy.
Game theory with costly computation: formulation and application to protocol security
It is shown that, when taking computation into account, the two approaches used for dealing with "deviating" players in two different communities-Nash equilibrium in game theory and zero-knowledge "simulation" in cryptography-are intimately related.
Non-computable strategies and discounted repeated games
This paper investigates whether the decision problem can be closed by adopting Turing machines as the standard of computability, and concludes that the answer is negative.
Modeling Bounded Rationality
The notion of bounded rationality was initiated in the 1950s by Herbert Simon; only recently has it influenced mainstream economics. In this book, Ariel Rubinstein defines models of bounded
The Definition of Random Sequences
Essai philosophique sur les probabilités
OUR students spend little or no time in the study of the classical documents of scientific discovery. This neglect is very much to be regretted, for there can be no doubt that nothing is so inspiring
Monoidal computer II: Normal complexity by string diagrams
This formalization brings to the foreground the concept of normal complexity measures, which allow decompositions akin to Kleene’s normal form, where evaluating the complexity of a program does not require substantially more resources than evaluating the program itself.
Computability and randomness
This book provides a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.
I'm Doing as Well as I Can: Modeling People as Rational Finite Automata
It is shown that, if the probability of nature changing state goes to 0 and the number of states in the automaton increases, then this strategy performs optimally (as well as if it were omniscient and knew when nature was making its state changes).