An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
From MaRDI portal
Publication:5935839
DOI10.1023/A:1006406424957zbMath1081.91501OpenAlexW2132734950MaRDI QIDQ5935839
Publication date: 2000
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1006406424957
Related Items (9)
K-submodular functions and convexity of their Lovász extension ⋮ Dual greedy polyhedra, choice functions, and abstract convex geometries ⋮ A greedy algorithm for convex geometries ⋮ In memoriam Walter Kern ⋮ Note on pseudolattices, lattices and submodular linear programs ⋮ The restricted core of games on distributive lattices: how to share benefits in a hierarchy ⋮ A Hierarchical Model for Cooperative Games ⋮ A general model for matroids and the greedy algorithm ⋮ Simple games on closure spaces
This page was built for publication: An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
