EBSLG

 

 
European Business Schools Librarian's Group
Home About Series Subject/JEL codes Advanced Search
HEC Paris. Research Department 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; (follow links to similar papers)

JEL-Codes: C70; (follow links to similar papers)

51 pages, July 21, 2013

Before downloading any of the electronic versions below you should read our statement on copyright.
Download GhostScript for viewing Postscript files and the Acrobat Reader for viewing and printing pdf files.

Full text versions of the paper:

papers.cfm?abstract_id=2267373    PDF-file
Download Statistics

Questions (including download problems) about the papers in this series should be directed to Sandra Dupouy ()
Report other problems with accessing this service to Sune Karlsson () or Helena Lundin ().

Programing by
Design Joakim Ekebom

Handle: RePEc:ebg:heccah:1015 This page was generated on 2014-12-14 17:56:27