On the core of ordered submodular cost games

DOI10.1007/s101070050008zbMath0980.90103OpenAlexW2060590073MaRDI QIDQ1575071

Ulrich Faigle, Walter Kern

Publication date: 14 August 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050008

zbMATH Keywords

posetgreedy algorithmordercoresubmodularpolymatroidMonge property\(N\)-person game

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Cooperative games (91A12) Combinatorial optimization (90C27)

Related Items

K-submodular functions and convexity of their Lovász extension, Dual greedy polyhedra, choice functions, and abstract convex geometries, Lattice polyhedra and submodular flows, Single machine scheduling with release dates: a distributionally robust approach, Buyer-supplier games: optimization over the core, A ranking model for the greedy algorithm and discrete convexity, A system-theoretic model for cooperation, interaction and allocation, Structural aspects of ordered polymatroids, Approximately fair cost allocation in metric traveling salesman games, In memoriam Walter Kern, Note on pseudolattices, lattices and submodular linear programs, Monge extensions of cooperation and communication structures, Production-inventory games: A new class of totally balanced combinatorial optimization games, A Hierarchical Model for Cooperative Games, On the vertices of the \(k\)-additive core, A general model for matroids and the greedy algorithm, The Shapley value on convex geometries, Traveling salesman games with the Monge property