Abstract
Kalai and Zemel introduced a class of flow-games showing that these games have a non-empty core and that a minimum cut corresponds to a core allocation. We consider flow-games with a finite number of players on a network with infinitely many arcs: assuming that the total sum of the capacities is finite, we show the existence of a maximum flow and we prove that this flow can be obtained as limit of approximating flows on finite subnetworks. Similar results on the existence of core allocations and core elements are given also for minimum spanning network models (see Granot and Huberman) and semi-infinite linear production models (following the approach of Owen).
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.
