Operations research games: A survey. (With comments and rejoinder)

DOI10.1007/BF02579075zbMath1006.91009OpenAlexW1999587457MaRDI QIDQ1348703

Herbert Hamers, Ruud Hendrickx, P. E. M. Borm

Publication date: 16 June 2002

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579075

zbMATH Keywords

optimizationcooperative gamesoperations researchallocation problems

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Inventory, storage, reservoirs (90B05)

Related Items (64)

Some new results on generalized additive games ⋮ Multi-criteria minimum cost spanning tree games ⋮ Set-valued TU-games ⋮ On the equal surplus sharing interval solutions and an application ⋮ Sequencing interval situations and related games ⋮ The effect of consolidated periods in heterogeneous lot-sizing games ⋮ Economic lot-sizing games ⋮ Cooperation and sharing costs in a tandem queueing network ⋮ Simple and three-valued simple minimum coloring games ⋮ Highway games on weakly cyclic graphs ⋮ ALOHA networks: a game-theoretic approach ⋮ Resource allocation games: a compromise stable extension of bankruptcy games ⋮ Efficient computation of the Shapley value for large-scale linear production games ⋮ Allocating costs in set covering problems ⋮ Sequencing grey games ⋮ Approximate nucleolus-based revenue sharing in airline alliances ⋮ Chinese postman games with multi-located players ⋮ Generalized additive games ⋮ Minimum cost spanning tree games and spillover stability ⋮ An application of crypto cloud computing in social networks by cooperative game theory ⋮ Decentralized resource allocation for interdependent infrastructures resilience: a cooperative game approach ⋮ Sharing pollution permits under welfare upper bounds ⋮ Competition and cooperation in linear production and sequencing processes ⋮ Assignment markets that are uniquely determined by their core ⋮ A game theoretical approach to sharing penalties and rewards in projects ⋮ Cooperative location games based on the minimum diameter spanning Steiner subgraph problem ⋮ Pairwise solutions and the core of transportation situations ⋮ Pooling of critical, low-utilization resources with unavailability ⋮ A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects ⋮ Cooperative games and cost allocation problems ⋮ A cost allocation rule for \(k\)-hop minimum cost spanning tree problems ⋮ Selfish Transportation Games ⋮ On graphs which can or cannot induce Chinese Postman games with a non-empty core ⋮ Production-inventory games and PMAS-games: Characterizations of the Owen point ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ A core-allocation family for generalized holding cost games ⋮ Enforcing fair cooperation in production-inventory settings with heterogeneous agents ⋮ Cooperation in Markovian queueing models ⋮ Monotonic stable solutions for minimum coloring games ⋮ The minimum cost shortest-path tree game ⋮ Cooperation between multiple news-vendors with transshipments ⋮ On the Owen set of transportation situations ⋮ Congestion network problems and related games ⋮ The core and related solution concepts for infinite assignment games ⋮ The selectope for bicooperative games ⋮ Two-sided market situations with existing contracts ⋮ Collaborating freight forwarding enterprises ⋮ Transportation interval situations and related games ⋮ Production-inventory games: A new class of totally balanced combinatorial optimization games ⋮ A review on cost allocation methods in collaborative transportation ⋮ Comments on: cooperative games and cost allocation problems ⋮ Cooperation under interval uncertainty ⋮ Core Nonemptiness of Stratified Pooling Games: A Structured Markov Decision Process Approach ⋮ Power Indices in Spanning Connectivity Games ⋮ Comments on: Transversality of the Shapley value ⋮ Processing games with restricted capacities ⋮ Modeling cooperation on a class of distribution problems ⋮ Opportune moment strategies for a cost spanning tree game ⋮ On the grey obligation rules ⋮ AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING ⋮ Relationship between labeled network games and other cooperative games arising from attributes situations ⋮ Cooperative and axiomatic approaches to the knapsack allocation problem ⋮ Optimal equilibria in the non-cooperative game associated with cost spanning tree problem ⋮ On Analyzing Cost Allocation Problems: Cooperation Building Structures and Order Problem Representations

Cites Work

• GAMES ARISING FROM INFINITE PRODUCTION SITUATIONS
• Cores of Nonatomic Linear Production Games
• Matching, Euler tours and the Chinese postman
• The Nucleolus of a Characteristic Function Game
• A Limit Theorem on the Core of an Economy
• College Admissions and the Stability of Marriage
• A one-stage model of link formation and payoff division
• On the core of transportation games
• Cooperation in capital deposits
• On the convexity of games corresponding to sequencing situations with due dates.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties
• Connection problems in mountains and monotonic allocation schemes.
• The newsvendor game has a nonempty core
• Equilibrium in a discrete exchange economy with money
• Permutation games: Another class of totally balanced games
• Characterization of cores of assignment games
• Communication and cooperation in public network situations
• Game theoretic analysis of a bankruptcy problem from the Talmud
• Distributive justice in taxation
• Sequencing games
• On the core of a traveling salesman cost allocation game
• On balanced games and games with committee control
• Applications of efficient mergeable heaps for optimization problems on trees
• The central assignment game and the assignment markets
• A problem of rights arbitration from the Talmud
• Traveling salesman games
• Population monotonic allocation schemes for cooperative games with transferable utility
• The core of an \(m\)-sided assignment game
• Flow-shops with a dominant machine
• A further note on the nucleolus of the `airport game'
• Ordinal cost sharing
• On the concavity of delivery games
• Shared irrigation costs: An empirical and axiomatic analysis
• Airport problems and consistent allocation rules.
• Cost allocation in the Chinese postman problem
• An algorithm for finding the nucleolus of assignment games
• Average cost pricing versus serial cost sharing: An axiomatic comparison
• On the core of routing games
• Restricted component additive games
• On the balancedness of relaxed sequencing games
• Cost allocation in shortest path games
• On shortest path games
• Sharing the cost of a network: core and core allocations
• Minimum cost spanning tree games and population monotonic allocation schemes.
• On the equivalence between some local and global Chinese postman and traveling salesman graphs
• Cores of inventory centralization games
• Characterization of the Owen set of linear production processes
• Balancedness of permutation games and envy-free allocations in indivisible good economies
• Linear transformation of products: Games and economies
• Computing the nucleolus of some combinatorially-structured games.
• `Hydraulic' rationing
• On a new class of parallel sequencing situations and related games
• Weighted allocation rules for standard fixed tree games
• Multi-issue allocation situations
• On the balancedness of multiple machine sequencing games
• Cost allocation in spanning network enterprises with stochastic connection costs.
• The split core for sequencing games
• On computational methods for solutions of multiobjective linear production programming games
• A simple expression for the nucleolus in a special case
• On the nucleolus of neighbor games
• Consistency and monotonicity in assignment problems
• On games corresponding to sequencing situations with ready times
• The kernel/nucleolus of a standard tree game
• On some balanced, totally balanced and submodular delivery games
• Naturally submodular digraphs and forbidden digraph configurations
• Spanning network games.
• Balanced games arising from infinite linear models
• Production games under uncertainty
• Monotonic games are spanning network games
• The assignment game. I: The core
• On one-sided versus two-sided matching games
• Simple flow games
• On Computing the Nucleolus of a Balanced Connected Game
• Cooperation in one machine scheduling
• A note on the 5-person traveling salesman game
• Linear production with transport of products, resources and technology
• The irreducible Core of a minimum cost spanning tree game
• Totally balanced games arising from controlled programming problems
• On the Core and Dual Set of Linear Programming Games
• On the core and nucleolus of minimum cost spanning tree games
• Fixed-Route Cost Allocation
• A generalized linear production model: A unifying model
• A quadratic programming model for product configuration optimization
• Minimum cost spanning tree games
• The Shapley Value as Aircraft Landing Fees–Revisited
• Generalized Network Problems Yielding Totally Balanced Games
• Totally Balanced Games and Games of Flow
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
• Serial Cost Sharing
• On Some Network Flow Games
• Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
• A Simple Expression for the Shapley Value in a Special Case
• On the core of linear production games
• Cost allocation for a spanning tree
• On cost allocation for a spanning tree: A game theoretic approach
• Multicommodity network flows—A survey
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Sequencing and Cooperation
• Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP

This page was built for publication: Operations research games: A survey. (With comments and rejoinder)