On some approximately balanced combinatorial cooperative games
DOI10.1007/BF01414210zbMATH Open0788.90089MaRDI QIDQ3142154FDOQ3142154
Publication date: 6 December 1993
Published in: ZOR - Methods and Models of Operations Research (Search for Journal in Brave)
Recommendations
traveling salesmannon-empty corematching gamesbin packing gamescooperative \(n\)-person games\(\varepsilon\)-balancedmodel of taxationproper coalitions
Combinatorial optimization (90C27) Cooperative games (91A12) (n)-person games, (n>2) (91A06) Games involving graphs (91A43) Combinatorial games (91A46)
Cites Work
- Matching theory
- Traveling salesman games
- The assignment game. I: The core
- On the core of linear production games
- Title not available (Why is that?)
- On the core of network synthesis games
- Cost allocation for a spanning tree
- Heuristic analysis, linear programming and branch and bound
- Extensions of solution concepts by means of muliplicative \(\epsilon\)-tax games
- Quasi-Cores in a Monetary Economy with Nonconvex Preferences
- On the core of a traveling salesman cost allocation game
- Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
- On the Rate of Convergence of Some Stochastic Processes
- Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
- A sharp deviation inequality for the stochastic traveling salesman problem
Cited In (30)
- Approximate core allocations and integrality gap for the bin packing game
- Network strength games: the core and the nucleolus
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games
- Stabilization through taxation in \(n\)-person games
- On Some Classes of Balanced Games
- Complexity of core allocation for the bin packing game
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
- Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation
- Bin packing games
- On approximately fair cost allocation in Euclidean TSP games
- The Subset Sum game
- Traveling salesman games with the Monge property
- Integrality gap analysis for bin packing games
- On some balanced, totally balanced and submodular delivery games
- An overview on game theory applications to engineering
- A GAME-THEORETIC TREATMENT OF A TIME-DISCRETE EMISSION REDUCTION MODEL
- Coreness of cooperative games with truncated submodular profit functions
- Note on non-uniform bin packing games
- Approximating the least core value and least core of cooperative games with supermodular costs
- Balanced Silverman games on general discrete sets
- Cooperative game with nondeterministic returns
- Algorithmic solutions for maximizing shareable costs
- Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
- On the complexity of core, kernel, and bargaining set
- Approximate core allocations for edge cover games
- Approximate core allocations for edge cover games
- On the population monotonicity of independent set games
- On the rate of taxation in a cooperative bin packing game
- Dynamic linear programming games with risk-averse players
This page was built for publication: On some approximately balanced combinatorial cooperative games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142154)
