European Business Schools Librarian's Group

Les Cahiers de Recherche,
HEC Paris

No 1015: Approximate Implementation in Markovian Environments

Ludovic Renou () and Tristan Tomala ()

Abstract: This paper considers dynamic implementation problems with evolving private information (according to Markov processes). A social choice function is approximately implementable if there exists a dynamic mechanism such that the social choice function is implemented by an arbitrary large number of times with arbitrary high probability in every communication equilibrium. We show that if a social choice function is strictly efficient in the set of social choice functions that satisfy an undetectable condition, then it is approximately implementable. We revisit the classical monopolistic screening problem and show that the monopolist can extract the full surplus in almost all periods with arbitrary high probability.

Keywords: implementation; Markov Process; undetectability; efficiency

JEL-codes: C70

51 pages, July 21, 2013

Full text files

papers.cfm?abstract_id=2267373 PDF-file 

Download statistics

Questions (including download problems) about the papers in this series should be directed to Antoine Haldemann ()
Report other problems with accessing this service to Sune Karlsson ().

This page generated on 2018-02-22 16:53:02.