Mathematics of Plott choice functions
DOI10.1016/j.mathsocsci.2004.09.001zbMath1115.91022arXivmath/0304171OpenAlexW1989887370MaRDI QIDQ2486161
Gleb A. Koshevoy, Vladimir I. Danilov
Publication date: 5 August 2005
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0304171
LatticeCircuitConvex geometryChoice functionLinear orderPath independenceDirect imageConvex structureInverse imageSimple word
Convex functions and convex programs in convex geometry (52A41) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Social choice (91B14) Varieties of lattices (06B20)
Related Items (14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedoids
- Choice functions over a finite set: A summary
- The theory of convex geometries
- A circuit set characterization of antimatroids
- Choice using set-graph structures
- Some aspects of the general theory of best option choice
- Choice functions and abstract convex geometries
- Rational choice and revealed preference without binariness
- Path Independence, Rationality, and Social Choice
- Path-Independent Social Choice Functions: A Further Result
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
- Locally complete path independent choice functions and their lattices
This page was built for publication: Mathematics of Plott choice functions