Abstract
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.
Full Text
Submitted Version (
Free)
Published Version
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 call