Generalized Network Problems Yielding Totally Balanced Games

Ehud Kalai and Eitan Zemel
Additional contact information
Eitan Zemel: Northwestern University, Evanston, Illinois

Operations Research, 1982, vol. 30, issue 5, 998-1008

Abstract: A class of multiperson mathematical optimization problems is considered and is shown to generate cooperative games with nonempty cores. The class includes, but is not restricted to, numerous versions of network flow problems. It was shown by Owen that for games generated by linear programming optimization problems, optimal dual solutions correspond to points in the core. We identify a special class of network flow problems for which the converse is true, i.e., every point in the core corresponds to an optimal dual solution.

Keywords: 1 cost allocations and revenue sharing in integrated systems; 231 games on generalized networks; 481 multiperson flow problems (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (35)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.5.998 (application/pdf)

Related works:
Working Paper: Generalized Network Problems Yielding Totally Balanced Games (1980)
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:inm:oropre:v:30:y:1982:i:5:p:998-1008

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().