On the Core and Dual Set of Linear Programming Games
From MaRDI portal
Publication:3323732
DOI10.1287/moor.9.2.309zbMath0537.90103OpenAlexW2047405463MaRDI QIDQ3323732
Publication date: 1984
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/485.pdf
coremarket gamestotally balanced gameslinear programming gamesnecessary and sufficient condition for finite convergenceoptimal dual solutions
Related Items
A core-allocation for a network restricted linear production game, Operations research games: A survey. (With comments and rejoinder), Stability and fairness in models with a multiple membership, Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner, Totally balanced games arising from controlled programming problems, Strategic behavior and partial cost sharing., Managing decentralized inventory and transshipment, Averaged dual solution for linear production games and its characterization, Pairwise solutions and the core of transportation situations, Stable Payment Schemes of Tu-Games With Multiple Crieria1, Linear production games with committee control: limiting behaviour of the core., Revenue sharing for resource reallocation among project activity contractors, Dynamic linear programming games with risk-averse players, A note on the Owen set of linear programming games and Nash equilibria, Stochastic programming, cooperation, and risk exchange, Collaboration in Cargo Transportation, Characterization of the Owen set of linear production processes, On market prices in linear production games
