Abstract
We present a purification result for incomplete information games with a large finite number of players that allows for compact metric spaces of actions and types. This result is then used to generalize the purfication theorems of Schmeidler (1973), Rashid (1983) and Kalai (2004). Our proofs are elementary and rely on the Shapley-Folkman theorem.
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.
