Locally complete path independent choice functions and their lattices

DOI10.1016/S0165-4896(00)00076-7zbMath0987.91024OpenAlexW2017716291MaRDI QIDQ5939662

Richard A. Dean, Mark R. Johnson

Publication date: 20 June 2002

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-4896(00)00076-7

zbMATH Keywords

latticealgebraic structurerationalizationchoice functionslocally completelocally distributivepath independence

Mathematics Subject Classification ID

Social choice (91B14)

Related Items

A hyper-relation characterization of weak pseudo-rationalizability ⋮ SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES ⋮ Resolutions of convex geometries ⋮ Closure and preferences ⋮ A discrete duality between nonmonotonic consequence relations and convex geometries ⋮ Congruence relations on a choice space ⋮ CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE ⋮ WARP and combinatorial choice ⋮ Behavioral implications of shortlisting procedures ⋮ Cognitive constraints, contraction consistency, and the satisficing criterion ⋮ Embedding convex geometries and a bound on convex dimension ⋮ Transformations of discrete closure systems ⋮ The duality between the anti-exchange closure operators and the path independent choice operators on a finite set ⋮ Mathematics of Plott choice functions ⋮ Path-independence and closure operators with the anti-exchange property ⋮ The computational complexity of rationalizing behavior ⋮ The affine representation theorem for abstract convex geometries ⋮ Embedded choices ⋮ Set and revealed preference axioms for multi-valued choice ⋮ On lexicographic choice ⋮ On Capacity-Filling and Substitutable Choice Rules ⋮ Choice functions and extensive operators ⋮ Substitutable choice functions and convex geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New problems in the general choice theory
• Characterizing fidelity for reflexive choices
• Choice functions and abstract convex geometries
• Reducible classes of finite lattices
• Path independence in serial-parallel data processing
• Ideal structures of path independent choice functions
• Information, associativity, and choice requirements
• Synopses in the Theory of Choice
• Path Independence, Rationality, and Social Choice
• Asymptotic Enumeration of Partial Orders on a Finite Set
• The Number of Finite Topologies
• Rational Selection of Decision Functions