Network flow problems and permutationally concave games

Mathematical Social Sciences

Volumn 58, Issue 1, 2009, Pages 121-131

  Trudeau, Christian ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

Concavity; Core; Network; Stability

Indexed keywords

EID: 67349235951     PISSN: 01654896     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mathsocsci.2009.01.002     Document Type: Article

References (15)

1. Alidaee B. Proof of permutationally convexity of mcsf games. Mathematical Methods of Operations Research 39 (1994) 243-248
2. Bird C.G. On cost allocation for a spanning tree: A game theoretic approach. Networks 6 (1976) 335-350
3. Driessen T.S.H. On cores of subconvex games and permutationally convex games. Methods of Operations Research 60 (1990) 313-323
4. Driessen T.S.H., and Meinhardt H. Convexity of production, common pool and oligopoly games: A survey. In: Wieczorek A., Malawski M., and Wiszniewska-Matyszkiel A. (Eds). Game Theory and Mathematical Economics (2006), Banach Center Publications, Institute of Mathematics, Polish Academy of Science, Warsaw 83-92
5. Dutta B., and Kar A. Cost monotonicity, consistency and minimum cost spanning tree games. Games and Economic Behavior 48 (2004) 223-248
6. Granot D., and Huberman G. The relationship between convex games and minimum cost spanning tree games: A case for permutationally convex games. SIAM Journal on Algebraic and Discrete Methods 3 (1982) 288-292
7. Granot D., and Huberman G. On the core and nucleolus of the minimum cost spanning tree games. Mathematical Programming 29 (1984) 323-347
8. Guisewite G., and Pardalos P. Algorithms for the single-source uncapacitated minimum concave-cost network flow problem. Journal of Global Optimization 1 (1991) 245-265
9. Ichiishi T. Super-modularity: Applications to convex games and to the greedy algorithm for LP. Journal of Economic Theory 25 (1981) 283-286
10. Meca, A., Timmer, J., Garcia-Jurado, I., 1999. Inventory games. CentER Discussion Paper 9953
11. Quant M., Borm P., and Reijnierse H. Congestion network problems and related games. European Journal of Operations Research 172 (2006) 919-930
12. Shapley L.S. Cores of convex games. International Journal of Game Theory 1 (1971) 11-26
13. van Velzen B. Sequencing games with controllable times. European Journal of Operations Research 172 (2006) 64-85
14. van Velzen B., and Hamers H. On the balancedness of relaxed sequencing games. Mathematical Methods of Operations Research 57 (2003) 287-297
15. Zangwill W. Minimum concave cost flows in certain networks. Management Science 14 (1968) 429-450