On the core of ordered submodular cost games

DOI10.1007/S101070050008MaRDI QIDQ1575071zbMATH OpenOpenAlexFDO

Authors U. 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, https://ris.utwente.nl/ws/files/6708956/Faigle00on.pdf

zbMATH Keywords

\(N\)-person gamecoregreedy algorithmMonge propertyorderpolymatroidposetsubmodular

Mathematics Subject Classification ID

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

Recommendations

• An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
• Submodular linear programs on forests
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Coeur et nucléolus des jeux de recouvrement
• A Hierarchical Model for Cooperative Games

Cited in

(25)

• Production-inventory games: A new class of totally balanced combinatorial optimization games
• A general model for matroids and the greedy algorithm
• The Shapley value on convex geometries
• K-submodular functions and convexity of their Lovász extension
• Traveling salesman games with the Monge property
• Submodular linear programs on forests
• Lattice polyhedra and submodular flows
• On some balanced, totally balanced and submodular delivery games
• Structural aspects of ordered polymatroids
• In memoriam Walter Kern
• New polyhedral and algorithmic results on greedoids
• Dual greedy polyhedra, choice functions, and abstract convex geometries
• A ranking model for the greedy algorithm and discrete convexity
• On the vertices of the k-additive core
• Polymatroid optimization, submodularity, and joint replenishment games
• A Hierarchical Model for Cooperative Games
• An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
• Single machine scheduling with release dates: a distributionally robust approach
• Buyer-supplier games: optimization over the core
• A branch-and-cut algorithm for submodular interdiction games
• A system-theoretic model for cooperation, interaction and allocation
• Distributionally robust single machine scheduling with release and due dates over Wasserstein balls
• Approximately fair cost allocation in metric traveling salesman games
• Note on pseudolattices, lattices and submodular linear programs
• Monge extensions of cooperation and communication structures

This page was built for publication: On the core of ordered submodular cost games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575071)