Network flow problems and permutationally concave games
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.
Year of publication: |
2009
|
---|---|
Authors: | Trudeau, Christian |
Published in: |
Mathematical Social Sciences. - Elsevier, ISSN 0165-4896. - Vol. 58.2009, 1, p. 121-131
|
Publisher: |
Elsevier |
Subject: | Stability Core Network Concavity |
Saved in:
Saved in favorites
Similar items by person
-
A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
Trudeau, Christian, (2012)
-
Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
Trudeau, Christian, (2014)
-
Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
Trudeau, Christian, (2013)
- More ...