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.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
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.:
- 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, 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.
- 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.
- van Velzen, Bas, 2006. "Sequencing games with controllable processing times," European Journal of Operational Research, Elsevier, vol. 172(1), pages 64-85, July.
- Meca-Martinez, A. & Timmer, J.B. & Garcia-Jurado, I. & Borm, P.E.M., 1999.
1999-53, Tilburg University, Center for Economic Research.
- Quant, Marieke & Borm, Peter & Reijnierse, Hans, 2006.
"Congestion network problems and related games,"
European Journal of Operational Research,
Elsevier, vol. 172(3), pages 919-930, August.
- Quant, M. & Borm, P.E.M. & Reijnierse, J.H., 2006. "Congestion network problems and related games," Other publications TiSEM f0e1d881-73d2-4bda-9137-4, Tilburg University, School of Economics and Management.
- Quant, M. & Borm, P.E.M. & Reijnierse, J.H., 2003. "Congestion Network Problems and Related Games," Discussion Paper 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.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:58:y:2009:i:1:p:121-131. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.