Computing a mechanism for a Bayesian and partially observable Markov approach

DOI10.34768/amcs-2023-0034zbMath1530.91125MaRDI QIDQ6069356

Alexander S. Poznyak, Julio B. Clempner

Publication date: 14 November 2023

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

zbMATH Keywords

regularizationBayesian equilibriumdynamic mechanism designpartially observable Markov chainsgames with private information

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Mechanism design theory (91B03) Games with incomplete information, Bayesian games (91A27)

Cites Work

• Unnamed Item
• Computing the strong Nash equilibrium for Markov chains games
• On three methods for bounding the rate of convergence for some continuous-time Markov chains
• Reliability-aware zonotopic tube-based model predictive control of a drinking water network
• A Tikhonov regularized penalty function approach for solving polylinear programming problems
• Selling options
• Sequential Screening
• Dynamic Mechanism Design for Online Commerce
• Mechanism Design by an Informed Principal
• Optimal Auction Design
• On Efficient Distribution with Private Information
• Dynamic Mechanism Design: A Myersonian Approach
• A Tikhonov regularization parameter approach for solving Lagrange constrained optimization problems
• Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism
• An Efficient Dynamic Mechanism
• Optimal Information Disclosure in Auctions and the Handicap Auction

This page was built for publication: Computing a mechanism for a Bayesian and partially observable Markov approach