Choice functions over a finite set: A summary
From MaRDI portal
Publication:1064952
DOI10.1007/BF00437315zbMath0576.90004OpenAlexW2016120321MaRDI QIDQ1064952
Publication date: 1985
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00437315
Related Items (81)
Essentiality and convexity in the ranking of opportunity sets ⋮ A hyper-relation characterization of weak pseudo-rationalizability ⋮ Complexity of Safe Strategic Voting ⋮ Indifference and incompleteness distinguished by rational trade ⋮ Choosing from a tournament ⋮ Indeterminacy and Belief Change ⋮ Partially dominant choice ⋮ \((m, n)\)-rationalizable choices ⋮ Minimal rationalizations ⋮ The dynamics and revealed preference of status-quo optimality ⋮ Luce rule with limited consideration ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ Dual greedy polyhedra, choice functions, and abstract convex geometries ⋮ Pareto rationalizability by two single-peaked preferences ⋮ Extreme point axioms for closure spaces ⋮ On the maximization of menu-dependent interval orders ⋮ On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller ⋮ Resolutions of convex geometries ⋮ Dynamic consistency and ambiguity: a reappraisal ⋮ Prudence and extensionality in theories of preference and value ⋮ Single-crossing choice correspondences ⋮ Matroids on convex geometries (cg-matroids) ⋮ Rationality and order-dependent sequential rationality ⋮ The rationalizability of two-step choices ⋮ Odd choices: on the rationality of some alleged anomalies of decision and inference ⋮ Increasing discriminatory power in well-being analysis using convex stochastic dominance ⋮ Congruence relations on a choice space ⋮ On the observable restrictions of limited consideration models: theory and application ⋮ Similarity-based mistakes in choice ⋮ On rational choice from lists of sets ⋮ Statement of precedence and a comment on IIA terminology ⋮ The testable implications of zero-sum games ⋮ A ranking model for the greedy algorithm and discrete convexity ⋮ Choosing two finalists and the winner ⋮ Comparative statics for size-dependent discounts in matching markets ⋮ Implementation without rationality assumptions ⋮ Set-rationalizable choice and self-stability ⋮ Iterated elimination procedures ⋮ Rationalizable choice functions ⋮ A system-theoretic model for cooperation, interaction and allocation ⋮ Rationalizing two-tiered choice functions through conditional choice ⋮ Absolutely determined matrices ⋮ Confidence in preferences ⋮ Choice functions with states of mind ⋮ A generalization of Moulin's Pareto extension theorem ⋮ Choice resolutions ⋮ Indifference or indecisiveness? Choice-theoretic foundations of incomplete preferences ⋮ Weakened WARP and top-cycle choice rules ⋮ Conditional choice with a vacuous second tier ⋮ Path independent choice and the ranking of opportunity sets ⋮ A college admissions clearinghouse ⋮ Manipulability of choice aggregations ⋮ The duality between the anti-exchange closure operators and the path independent choice operators on a finite set ⋮ Axiomatic characterizations of voting operators ⋮ Choosing among maximals ⋮ Economics and Economy in the Theory of Belief Revision (Preliminary Report) ⋮ Mathematics of Plott choice functions ⋮ Rationalizations of choice functions ⋮ Path-independence and closure operators with the anti-exchange property ⋮ Essential alternatives and freedom rankings ⋮ Set and revealed preference axioms for multi-valued choice ⋮ The history of social choice in Russia and the Soviet Union ⋮ On lexicographic choice ⋮ A simple characterization of responsive choice ⋮ A prudent characterization of the ranked pairs rule ⋮ On Capacity-Filling and Substitutable Choice Rules ⋮ Hyper-relations, choice functions, and orderings of opportunity sets ⋮ Reason-based choice correspondences ⋮ A Hierarchical Model for Cooperative Games ⋮ Deterministic walks with choice ⋮ Choice functions and hard choices ⋮ Choice functions and extensive operators ⋮ Weak pseudo-rationalizability ⋮ Finite and infinite complexity in axioms of rational choice or Sen's characterization of preference-compatibility cannot be improved ⋮ Non-binary choice functions on non-compact sets ⋮ On the extension of binary relations in economic and game theories ⋮ Symmetry in domination for hypergraphs with choice ⋮ Revealed preference axioms for continuous rational choice ⋮ Choice functions and abstract convex geometries ⋮ Independent necessary and sufficient conditions for approval voting ⋮ On the continuous analogue of the Szpilrajn theorem. I
Cites Work
This page was built for publication: Choice functions over a finite set: A summary
