Totally balanced combinatorial optimization games
From MaRDI portal
Publication:1575068
DOI10.1007/s101070050005zbMath0978.91005OpenAlexW1998462138MaRDI QIDQ1575068
Toshihide Ibaraki, Wenan Zang, Hiroshi Nagamochi, Xiaotie Deng
Publication date: 10 June 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050005
Related Items (20)
Some new results on generalized additive games ⋮ The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems ⋮ Population monotonicity in matching games ⋮ Component Acquisition Games ⋮ Simple and three-valued simple minimum coloring games ⋮ Fair cost allocations under conflicts - a game-theoretic point of view - ⋮ Graphs inducing totally balanced and submodular Chinese postman games ⋮ On the submodularity of multi-depot traveling salesman games ⋮ Production-inventory games and PMAS-games: Characterizations of the Owen point ⋮ Monotonic stable solutions for minimum coloring games ⋮ LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES ⋮ Population monotonic allocation schemes for vertex cover games ⋮ Competitive cost sharing with economies of scale ⋮ Production-inventory games: A new class of totally balanced combinatorial optimization games ⋮ On stability of collaborative supplier selection ⋮ Total balancedness condition for Steiner tree games. ⋮ Set-weighted games and their application to the cover problem ⋮ On the population monotonicity of independent set games ⋮ On the properties of weighted minimum colouring games ⋮ On games arising from multi-depot Chinese postman problems
This page was built for publication: Totally balanced combinatorial optimization games
