Balancedness Of The Class Of Infinite Permutation Games And Related Classes Of Games
Recently it is proved that all infinite assignment games have a non-empty core. Using this fact, and a technique suggested by L. S. Shapley for finite permutation games, we prove similar results for infinite permutation games. Infinite transportation games can be interpreted as a generalization of infinite assignment games. We show that infinite transportation games are balanced via a related assignment game. By using certain core elements of infinite transportation games it can be shown that infinite pooling games have a non-empty core.
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 09 (2007)
Issue (Month): 03 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/igtr/igtr.shtml |
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:09:y:2007:i:03:p:425-435. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.