Abstract
We study the problem of optimal mechanism design for incomplete information Stackelberg games with several followers in which each follower, guided by his own probability assessments concerning the characteristics of the other followers, behaves as a Bayesian in choosing a reporting strategy. Allowing for uncountably many types and infinite dimensional type descriptions, we present a new, general existence result for Bayesian incentive compatible (BIC) mechanisms. Because the existence problem is infinite dimensional, novel existence arguments are required. Our existence proof is based on two results: one on the sequential closure of the subset of BIC mechanisms with respect toK-convergence, and the other, a new result on sequential compactness in spaces of vector-valued functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
