Mathematics of Plott choice functions
From MaRDI portal
Publication:2486161
Abstract: This paper is devoted to a study of mathematical structures arising from choice functions satisfying the path independence property (Plott functions). We broaden the notion of a choice function by allowing of empty choice. This enables us to define a lattice structure on the set of Plott functions. Moreover, this lattice is functorially dependent on its base. We introduce a natural convex structure on the set of linear orders (or words) and show that Plott functions are in one-to-one correspondence with convex subsets in this set of linear orders. That correspondence is compatible with both lattice structures. Keywords: Convex geometries, shuffle, linear orders, lattices, direct image, path independence, convex structure
Recommendations
- scientific article; zbMATH DE number 2000773
- Matroidal choice functions
- Numerical representation of choice functions
- Choice Functions Generated by Mallows and Plackett–Luce Relations
- Choice functions in the intersection of matroids
- scientific article; zbMATH DE number 3941295
- Choice functions on posets
- Choquet integrals in potential theory
- Choice functions and abstract convex geometries
- Function theory in plane and space
Cites work
- A circuit set characterization of antimatroids
- Choice functions and abstract convex geometries
- Choice functions over a finite set: A summary
- Choice using set-graph structures
- Greedoids
- scientific article; zbMATH DE number 4147800 (Why is no real title available?)
- scientific article; zbMATH DE number 4050423 (Why is no real title available?)
- scientific article; zbMATH DE number 1131289 (Why is no real title available?)
- scientific article; zbMATH DE number 2159636 (Why is no real title available?)
- scientific article; zbMATH DE number 3297895 (Why is no real title available?)
- Locally complete path independent choice functions and their lattices
- Path Independence, Rationality, and Social Choice
- Path-Independent Social Choice Functions: A Further Result
- Rational choice and revealed preference without binariness
- Some aspects of the general theory of best option choice
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
- The theory of convex geometries
Cited in
(18)- Choice functions and extensive operators
- Closure and preferences
- Rationalizable choice functions
- Path independent choice and the ranking of opportunity sets
- Substitutable choice functions and convex geometry
- Statement of precedence and a comment on IIA terminology
- Solution concepts for games with general coalitional structure
- Hyper-relations, choice functions, and orderings of opportunity sets
- Knowledge spaces from a topological point of view
- scientific article; zbMATH DE number 2000773 (Why is no real title available?)
- Review of the theory of stable matchings and contract systems
- Mixture sets on finite domains
- On rational choice from lists of sets
- Complementary choice functions
- Introduction to the theory of choice and stable contracts
- A hyper-relation characterization of weak pseudo-rationalizability
- Orders on subsets rationalised by abstract convex geometries
- Matroids on convex geometries (cg-matroids)
This page was built for publication: Mathematics of Plott choice functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486161)