Duality between quasi-concave functions and monotone linkage functions

DOI10.1016/j.disc.2009.09.001zbMath1228.05280arXiv0808.3244MaRDI QIDQ712240

Vadim E. Levit, Yulia Kempner

Publication date: 28 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0808.3244

zbMATH Keywords

greedy algorithm; convex geometry; quasi-concave function; monotone linkage function

Mathematics Subject Classification ID

91B02: Fundamental topics (basic mathematics, methodology; applicable to economics in general)

05D05: Extremal set theory

05B25: Combinatorial aspects of finite geometries

51A05: General theory of linear incidence geometry and projective geometries

Cites Work

• Unnamed Item
• Unnamed Item
• Greedoids
• Nuclei of monotonic systems on a semilattice of sets
• Entropy of capacities on lattices and set systems
• Incomplete classifications of a finite set of objects using monotone systems
• The theory of convex geometries
• Extremal subsystems of monotonic systems. I
• Monotone linkage clustering and quasi-concave set functions
• Correspondence between two antimatroid algorithmic characterizations
• Layered clusters of tightness set functions
• Induced layered clusters, hereditary mappings, and convex geometries
• An axiomatization of entropy of capacities on set systems
• Quasi-concave functions on meet-semilattices
• Choice Functions and Revealed Preference
• Matroids and the greedy algorithm
• Rational Selection of Decision Functions
• The duality between the anti-exchange closure operators and the path independent choice operators on a finite set