On some approximately balanced combinatorial cooperative games

DOI10.1007/BF01414210zbMath0788.90089MaRDI QIDQ3142154

Walter Kern, Ulrich Faigle

Publication date: 6 December 1993

Published in: ZOR - Methods and Models of Operations Research (Search for Journal in Brave)

zbMATH Keywords

traveling salesmannon-empty corematching gamesbin packing gamescooperative \(n\)-person games\(\varepsilon\)-balancedmodel of taxationproper coalitions

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Combinatorial optimization (90C27) (n)-person games, (n>2) (91A06) Combinatorial games (91A46)

Related Items (24)

Approximate core allocations and integrality gap for the bin packing game ⋮ Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games ⋮ Complexity of core allocation for the bin packing game ⋮ The Subset Sum game ⋮ A GAME-THEORETIC TREATMENT OF A TIME-DISCRETE EMISSION REDUCTION MODEL ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ Cooperative game with nondeterministic returns ⋮ On approximately fair cost allocation in Euclidean TSP games ⋮ Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner ⋮ Approximate core allocations for edge cover games ⋮ On the rate of taxation in a cooperative bin packing game ⋮ Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ On the complexity of core, kernel, and bargaining set ⋮ Note on non-uniform bin packing games ⋮ Dynamic linear programming games with risk-averse players ⋮ Integrality gap analysis for bin packing games ⋮ Coreness of cooperative games with truncated submodular profit functions ⋮ Network strength games: the core and the nucleolus ⋮ Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation ⋮ Traveling salesman games with the Monge property ⋮ On the population monotonicity of independent set games ⋮ Bin packing games ⋮ AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING

Cites Work

• Unnamed Item
• On the core of network synthesis games
• Matching theory
• Extensions of solution concepts by means of muliplicative \(\epsilon\)-tax games
• On the core of a traveling salesman cost allocation game
• Traveling salesman games
• A sharp deviation inequality for the stochastic traveling salesman problem
• The assignment game. I: The core
• Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
• On the Rate of Convergence of Some Stochastic Processes
• Heuristic analysis, linear programming and branch and bound
• On the core of linear production games
• Cost allocation for a spanning tree
• Quasi-Cores in a Monetary Economy with Nonconvex Preferences
• Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space

This page was built for publication: On some approximately balanced combinatorial cooperative games