Balanced games arising from infinite linear models
Vito Fragnelli (),
Fioravante Patrone,
Enrico Sideri and
Stef Tijs
Mathematical Methods of Operations Research, 1999, vol. 50, issue 3, 385-397
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). Copyright Springer-Verlag Berlin Heidelberg 1999
Keywords: Key words: Balancedness; semi-infinite linear models (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (16)
Downloads: (external link)
http://hdl.handle.net/10.1007/s001860050077 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:50:y:1999:i:3:p:385-397
Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186
DOI: 10.1007/s001860050077
Access Statistics for this article
Mathematical Methods of Operations Research is currently edited by Oliver Stein
More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().