Locally complete path independent choice functions and their lattices

DOI10.1016/S0165-4896(00)00076-7zbMATH Open0987.91024OpenAlexW2017716291MaRDI QIDQ5939662FDOQ5939662

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

latticerationalizationchoice functionsalgebraic structurepath independencelocally completelocally distributive

Mathematics Subject Classification ID

Social choice (91B14)

Cites Work

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

Cited In (23)

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

This page was built for publication: Locally complete path independent choice functions and their lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939662)