We present a puri¯cation result for incomplete information games with a large ¯nite number of players that allows for compact metric spaces of actions and types. This result is then used to generalize the puri¯cation theorems of Schmeidler (1973), Rashid (1983) and Kalai (2004). Our proofs are elementary and rely on the Shapley-Folkman theorem.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Universidade Nova de Lisboa, Faculdade de Economia in its series FEUNL Working Paper Series with number
wp491.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: