Abstract
AbstractWe define a new concept of constrained strategic equilibrium (CSE) for Bayesian games. We show that a sequence of CSEs approximates an equilibrium under standard conditions. We also provide an algorithm to implement the CSE approximation method numerically in a broad class of Bayesian games, including games without analytically tractable solutions. Finally, we illustrate the flexibility of the CSE approximation with a series of auction examples, including a complex multi‐unit auction. Copyright © 2008 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.