Network flow problems and permutationally concave games
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Mathematical Social Sciences.
Volume (Year): 58 (2009)
Issue (Month): 1 (July)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565
Stability Core Network Concavity;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Meca, A. & Timmer, J.B. & Garcia-Jurado, I. & Borm, P.E.M., 2004.
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-129329, Tilburg University.
- Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
- Dutta, Bhaskar & Kar, Anirban, 2002.
"Cost Monotonicity, Consistency And Minimum Cost Spanning Tree Games,"
The Warwick Economics Research Paper Series (TWERPS)
629, University of Warwick, Department of Economics.
- Dutta, Bhaskar & Kar, Anirban, 2004. "Cost monotonicity, consistency and minimum cost spanning tree games," Games and Economic Behavior, Elsevier, vol. 48(2), pages 223-248, August.
- Bhaskar Dutta & Anirban Kar, 2002. "Cost monotonicity, consistency and minimum cost spanning tree games," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 02-04, Indian Statistical Institute, New Delhi, India.
- van Velzen, Bas, 2006. "Sequencing games with controllable processing times," European Journal of Operational Research, Elsevier, vol. 172(1), pages 64-85, July.
- Quant, M. & Borm, P.E.M. & Reijnierse, J.H., 2003.
"Congestion Network Problems and Related Games,"
2003-106, Tilburg University, Center for Economic Research.
- Willard I. Zangwill, 1968. "Minimum Concave Cost Flows in Certain Networks," Management Science, INFORMS, vol. 14(7), pages 429-450, March.
- Trudeau, Christian, 2014.
"Minimum cost spanning tree problems with indifferent agents,"
Games and Economic Behavior,
Elsevier, vol. 84(C), pages 137-151.
- Christian Trudeau, 2013. "Minimum cost spanning tree problems with indifferent agents," Working Papers 1306, University of Windsor, Department of Economics.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.