Approximate implementation in Markovian environments

DOI10.1016/J.JET.2015.07.009zbMATH Open1330.91102OpenAlexW3121361211MaRDI QIDQ900435FDOQ900435

Authors: Ludovic Renou, Tristan Tomala 

Publication date: 22 December 2015

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jet.2015.07.009

Recommendations

• Implementation in generic environments
• Robust dynamic implementation
• A new approach to the implementation problem
• Virtual Bayesian Implementation
• Approximate Bayesian implementation and exact maxmin implementation: an equivalence

zbMATH Keywords

efficiencydynamicMarkov processesimplementationmechanism designundetectability

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Social choice (91B14) Auctions, bargaining, bidding and selling, and other market models (91B26) Multistage and repeated games (91A20) Dynamic games (91A25)

Cites Work

• Prediction, Learning, and Games
• Lower equilibrium payoffs in two-player repeated games with non- observable actions
• Repeated Principal-Agent Games with Discounting
• An Approach to Communication Equilibria
• The Folk Theorem with Imperfect Public Information
• Multistage Games with Communication
• Title not available (Why is that?)
• A new approach to the implementation problem
• Efficiency in games with Markovian private information
• Virtual Implementation in Nash Equilibrium
• Overcoming Incentive Constraints by Linking Decisions
• Monitoring Cooperative Agreements in a Repeated Principal-Agent Relationship
• Dynamic sender-receiver games
• Title not available (Why is that?)
• Hoeffding's inequality for uniformly ergodic Markov chains
• Role of linking mechanisms in multitask agency with hidden information
• Efficient repeated implementation
• Complexity and repeated implementation

Cited In (7)

• Repeated implementation: a practical characterization
• Approximate Bayesian implementation and exact maxmin implementation: an equivalence
• Unraveling in a repeated moral hazard model with multiple agents
• Cooperation dynamics in repeated games of adverse selection
• Implementation in generic environments
• Shannon meets Myerson: information extraction from a strategic sender
• Codes of conduct, private information and repeated games

This page was built for publication: Approximate implementation in Markovian environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q900435)