M
Martin Cripps
Researcher at University College London
Publications - 44
Citations - 1841
Martin Cripps is an academic researcher from University College London. The author has contributed to research in topics: Repeated game & Stochastic game. The author has an hindex of 21, co-authored 44 publications receiving 1760 citations. Previous affiliations of Martin Cripps include Washington University in St. Louis & University of Warwick.
Papers
More filters
Journal ArticleDOI
Strategic Experimentation with Exponential Bandits
TL;DR: In this paper, a game of strategic experimentation with two-armed bandits whose risky arm might yield a payoff only after some exponentially distributed random time is studied, where players use stationary Markovian strategies with posterior beliefs as the state variable.
Journal ArticleDOI
Strategic Experimentation with Exponential Bandits
TL;DR: This paper studies a game of strategic experimentation with two-armed bandits whose risky arm might yield a payoff only after some exponentially distributed random time and characterizes the unique symmetric Markovian equilibrium of the game, which is in mixed strategies.
Journal ArticleDOI
Imperfect Monitoring and Impermanent Reputations
TL;DR: In this article, the authors study the long-run sustainability of reputation in games with imperfect public monitoring and show that a player cannot indefinitely sustain a reputation for noncredible behavior in the presence of imperfect monitoring.
Journal ArticleDOI
Imperfect Monitoring and Impermanent Reputations
TL;DR: In this paper, the authors study the long-run sustainability of reputation in games with imperfect public monitoring and show that a player cannot indefinitely sustain a reputation for non-credible behavior in the presence of imperfect monitoring.
Journal ArticleDOI
Efficiency of large double auctions
Martin Cripps,Jeroen M. Swinkels +1 more
TL;DR: In this paper, the authors consider large double auctions with private values and prove that all nontrivial equilibria of auctions that satisfy this notion are asymptotically efficient.