On some approximately balanced combinatorial cooperative games

ZOR - Methods and Models of Operations Research

Volumn 38, Issue 2, 1993, Pages 141-152

  Faigle, Ulrich ^a   Kern, Walter ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

balanced core; bin packing; cooperative game; matching; tax; traveling salesman

Indexed keywords

EID: 0042903195     PISSN: 03409422     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/BF01414210     Document Type: Article

References (17)

1. Some applications of linear programming methods to the theory of cooperative games
2. Cost allocation for a spanning tree
3. Probabilistic analysis of the Held and Karp lower bound for the euclidean TSP
4. On the rate of convergence of some stochastic processes
5. Matching theory
6. The core of linear production games
7. Traveling salesman games
8. A sharp deviation for the stochastic TSP
9. On balanced sets and cores
10. Quasi-cores in a monetary economy with nonconvex preferences
11. The assignment game I: The core
12. Probabilistic and worst case analyses of classical problems of combinatorial optimization in euclidean space
13. On the core of a traveling salesman cost allocation game
14. On the core of network synthesis games
15. Extensions of solution concepts by means of multiplicative ɛ-tax games
16. Heuristic analysis, Linear programming and branch and bound