Generalized Network Problems Yielding Totally Balanced Games
From MaRDI portal
Publication:3956717
DOI10.1287/opre.30.5.998zbMath0493.90032OpenAlexW2064699170MaRDI QIDQ3956717
Publication date: 1982
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/425.pdf
network flowtotally balanced gamesoptimal dual solutionscooperative games with nonempty coresmultiperson optimization problems
Programming involving graphs or networks (90C35) Cooperative games (91A12) Applications of game theory (91A80) Deterministic network models in operations research (90B10)
Related Items (max. 100)
A core-allocation for a network restricted linear production game ⋮ Stable allocations of risk ⋮ Activity optimization games with complementarity ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ The Cost of Stability in Network Flow Games ⋮ DEA production games and Owen allocations ⋮ Monotonicity of the core and value in dynamic cooperative games ⋮ The reactive bargaining set of some flow games and of superadditive simple games ⋮ Communication and its cost in graph-restricted games ⋮ The Least-Core and Nucleolus of Path Cooperative Games ⋮ A generalized linear production model: A unifying model ⋮ The complexity of egalitarian mechanisms for linear programming games ⋮ On balanced games and games with committee control ⋮ Totally balanced games arising from controlled programming problems ⋮ Strategic behavior and partial cost sharing. ⋮ Approximate core allocations for edge cover games ⋮ Efficient algorithms for game-theoretic betweenness centrality ⋮ Averaged dual solution for linear production games and its characterization ⋮ Cooperative maximum-flow problem under uncertainty in logistic networks ⋮ Cooperative location games based on the minimum diameter spanning Steiner subgraph problem ⋮ Pairwise solutions and the core of transportation situations ⋮ Balancedness conditions for exact games ⋮ Stable Payment Schemes of Tu-Games With Multiple Crieria1 ⋮ Pairwise mergers in bipartite matching games with an application in collaborative logistics ⋮ Cartels via the modiclus. ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ Cooperative games arising from network flow problems ⋮ Market Games and Clubs ⋮ Finding nucleolus of flow game ⋮ On totally balanced games arising from cooperation in fair division ⋮ Mechanism design for a multicommodity flow game in service network alliances ⋮ LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ Algorithms for core stability, core largeness, exactness, and extendability of flow games ⋮ On characterization of the core of lane covering games via dual solutions ⋮ Path cooperative games ⋮ Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis ⋮ Stochastic programming, cooperation, and risk exchange ⋮ Bargaining sets and the core in partitioning games ⋮ Collaboration in Cargo Transportation ⋮ A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications ⋮ On the core of network synthesis games ⋮ INFORMATION SHARING GAMES ⋮ On the concavity of delivery games ⋮ Modeling cooperation on a class of distribution problems ⋮ Characterization of the Owen set of linear production processes ⋮ On computational methods for solutions of multiobjective linear production programming games ⋮ Fuzzy cooperative games arising from linear production programming problems with fuzzy parameters ⋮ Solutions based on fuzzy goals in fuzzy linear programming games ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ Logistics networks: a game theory application for solving the transshipment problem ⋮ Permutation games: Another class of totally balanced games ⋮ Market equilibrium in a multistage commodity network ⋮ On market prices in linear production games ⋮ Competition and cooperation in non-centralized linear production games
This page was built for publication: Generalized Network Problems Yielding Totally Balanced Games
