Network flow problems and permutationally concave games

Christian Trudeau

Mathematical Social Sciences, 2009, vol. 58, issue 1, 121-131

Abstract: We examine network problems where agents have to be connected to a source in order to obtain goods, and in which costs on different arcs are a function of the flow of goods. When all cost functions are concave, the resulting game might have an empty core. We introduce a set of problems with concave functions, called the ordered quasi-symmetric congestion problems. We show that they generate permutationally concave games, a weakening of the concept of concavity, that ensures non-emptiness of the core.

Keywords: Stability; Core; Network; Concavity (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165-4896(09)00004-3
Full text for ScienceDirect subscribers only

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:eee:matsoc:v:58:y:2009:i:1:p:121-131

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().