Submodularity of some classes of the combinatorial optimization games

DOI10.1007/s001860300284zbMath1116.91306OpenAlexW2087299949MaRDI QIDQ1423711

Yoshio Okamoto

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

zbMATH Keywords

Combinatorial optimization, Game theory, Submodularity

Mathematics Subject Classification ID

Cooperative games (91A12) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial games (91A46)

Related Items (14)

Some new results on generalized additive games ⋮ Matroid representation of clique complexes ⋮ Component Acquisition Games ⋮ Simple and three-valued simple minimum coloring games ⋮ On the convexity of independent set games ⋮ Fair cost allocations under conflicts - a game-theoretic point of view - ⋮ Graphs inducing totally balanced and submodular Chinese postman games ⋮ Monotonic stable solutions for minimum coloring games ⋮ Population monotonic allocation schemes for vertex cover games ⋮ An efficient characterization of submodular spanning tree games ⋮ Traveling salesman games with the Monge property ⋮ On the properties of weighted minimum colouring games ⋮ A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games ⋮ On games arising from multi-depot Chinese postman problems

This page was built for publication: Submodularity of some classes of the combinatorial optimization games