论文信息 - On some approximately balanced combinatorial cooperative games

On some approximately balanced combinatorial cooperative games

A model of taxation for cooperativen-person games is introduced where proper coalitions Are taxed proportionally to their value. Games with non-empty core under taxation at rateɛ-balanced. Sharp bounds onɛ in matching games (not necessarily bipartite) graphs are estabLished. Upper and lower bounds on the smallestɛ in bin packing games are derived and euclidean random TSP games are seen to be, with high probability,ɛ-balanced forɛ≈0.06.

Ulrich Faigle | Walter Kern | U. Faigle | W. Kern

[1] Michel X. Goemans,et al. Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem , 1991, Math. Oper. Res..

[2] Walter Kern. On the Rate of Convergence of Some Stochastic Processes , 1989, Math. Oper. Res..

[3] Arie Tamir,et al. On the core of a traveling salesman cost allocation game , 1989 .

[4] Wansoo T. Rhee,et al. A sharp deviation inequality for the stochastic traveling salesman problem , 1989 .

[5] L. Wolsey. Heuristic analysis, linear programming and branch and bound , 1980 .

[6] L. Shapley,et al. QUASI-CORES IN A MONETARY ECONOMY WITH NONCONVEX PREFERENCES , 1966 .

[7] Guillermo Owen,et al. On the core of linear production games , 1975, Math. Program..

[8] J. Michael Steele,et al. Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space , 1990, Math. Oper. Res..

[9] Arie Tamir,et al. On the core of network synthesis games , 1991, Math. Program..

[10] S. Tijs,et al. Extensions of solution concepts by means of multiplicative å-games , 1986 .

[11] Lloyd S. Shapley,et al. On balanced sets and cores , 1967 .

[12] Stef Tijs,et al. Traveling salesman games , 1992, Math. Program..

[13] L. Shapley,et al. The assignment game I: The core , 1971 .

[14] Daniel J. Kleitman,et al. Cost allocation for a spanning tree , 1973, Networks.