Submodularity of some classes of the combinatorial optimization games
From MaRDI portal
Publication:1423711
DOI10.1007/s001860300284zbMath1116.91306MaRDI QIDQ1423711
Publication date: 7 March 2004
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/53707
91A12: Cooperative games
90C27: Combinatorial optimization
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
91A46: Combinatorial games
Related Items
Fair cost allocations under conflicts - a game-theoretic point of view -, Traveling salesman games with the Monge property, Monotonic stable solutions for minimum coloring games, Matroid representation of clique complexes, Graphs inducing totally balanced and submodular Chinese postman games