Choice functions over a finite set: A summary
Let A be a finite set of outcomes and B a nonempty subset of A. Let S be a choice function, such that S(B) is nonempty for all S. The following conditions on S are crucial: Chernoff: \(B\subset B'\to S(B')\cap B\subset S(B)\). Expansion: S(B)\(\cap S(B')\subset S(B\cup B')\). Aizerman: [S(B')\(\subset B\subset B']\to [S(B)\subset S(B')].\) The main results are the following. S is rationalizable if and only if it satisfies the Chernoff and Expansion conditions. S is Pareto- rationalizable if and only if it satisfies the Aizerman and Expansion conditions. Finally, S is pseudo-rationalizable if and only if it satisfies the Chernoff and Aizerman conditions. Although these results have existed in Russian for some time, this is the first time that they have been readily available in the West.
- Rational choice on non-finite sets by means of expansion-contraction axioms
- Choice functions: Rationality re-examined
- On the rationality and rationalizability of the choice function with respect to the optional set system
- Weak pseudo-rationalizability
- Rationalizing Choice Functions By Multiple Rationales
- Reason-based choice correspondences
- Choice functions and extensive operators
- Approximation of choice functions with a constrained set of presentations
- Choosing from a tournament
- Manipulability of choice aggregations
- Rational choice on non-finite sets by means of expansion-contraction axioms
- Non-binary choice functions on non-compact sets
- Revealed preference axioms for continuous rational choice
- Choice functions and abstract convex geometries
- Choice functions: Rationality re-examined
- Luce rule with limited consideration
- Notions from rough set theory in a generalized dependency relation context
- A college admissions clearinghouse
- Path-independence and closure operators with the anti-exchange property
- On lexicographic choice
- A simple characterization of responsive choice
- Effective choice functions and index sets
- Finite and infinite complexity in axioms of rational choice or Sen's characterization of preference-compatibility cannot be improved
- On the continuous analogue of the Szpilrajn theorem. I
- The dynamics and revealed preference of status-quo optimality
- Prudence and extensionality in theories of preference and value
- Odd choices: on the rationality of some alleged anomalies of decision and inference
- A generalization of Moulin's Pareto extension theorem
- Set and revealed preference axioms for multi-valued choice
- Choice functions and hard choices
- Minimal rationalizations
- Pareto rationalizability by two single-peaked preferences
- Dynamic consistency and ambiguity: a reappraisal
- Single-crossing choice correspondences
- Comparative statics for size-dependent discounts in matching markets
- Von Neumann-Morgenstern stable set rationalization of choice functions
- Iterated elimination procedures
- Rationalizable choice functions
- Choice resolutions
- Path independent choice and the ranking of opportunity sets
- Weak pseudo-rationalizability
- On the extension of binary relations in economic and game theories
- Symmetry in domination for hypergraphs with choice
- Essentiality and convexity in the ranking of opportunity sets
- Dual greedy polyhedra, choice functions, and abstract convex geometries
- On the maximization of menu-dependent interval orders
- Increasing discriminatory power in well-being analysis using convex stochastic dominance
- Congruence relations on a choice space
- 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
- Rationalizing two-tiered choice functions through conditional choice
- Confidence in preferences
- Indifference or indecisiveness? Choice-theoretic foundations of incomplete preferences
- Weakened WARP and top-cycle choice rules
- Mathematics of Plott choice functions
- The history of social choice in Russia and the Soviet Union
- Hyper-relations, choice functions, and orderings of opportunity sets
- Partially dominant choice
- Resolutions of convex geometries
- Indeterminacy and belief change
- (m, n)-rationalizable choices
- Complexity of safe strategic voting
- The satisfiability problem for Boolean set theory with a choice correspondence
- Branch-and-bound method for inherited choice functions
- Stable Matching
- Implementation without rationality assumptions
- scientific article; zbMATH DE number 1131289 (Why is no real title available?)
- Partial choice functions for families of finite sets
- Economics and economy in the theory of belief revision (preliminary report)
- On capacity-filling and substitutable choice rules
- Conditional choice with a vacuous second tier
- A Hierarchical Model for Cooperative Games
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
- Axiomatic characterizations of voting operators
- Rationalizations of choice functions
- On the observable restrictions of limited consideration models: theory and application
- The rationalizability of two-step choices
- On rational choice from lists of sets
- Set-rationalizable choice and self-stability
- A system-theoretic model for cooperation, interaction and allocation
- On some weakened forms of transitivity in the logic of conditional obligation
- Revealed VNM-solutions: characterizations
- Resolutions of probabilistic choice spaces
- A model of rejection-based decision making
- Meritocracy versus diversity
- Choosing among maximals
- Between burgess and Lewis. II: Semantics without rational monotonicity
- Essential alternatives and freedom rankings
- A decomposition from a many-to-one matching market with path-independent choice functions to a one-to-one matching market
- A prudent characterization of the ranked pairs rule
- Deterministic walks with choice
- Independent necessary and sufficient conditions for approval voting
- A hyper-relation characterization of weak pseudo-rationalizability
- Indifference and incompleteness distinguished by rational trade
- Extreme point axioms for closure spaces
- On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller
- Matroids on convex geometries (cg-matroids)
- Rationality and order-dependent sequential rationality
- On justifiable choice functions over opportunity sets
- Similarity-based mistakes in choice
- Choosing two finalists and the winner
- Absolutely determined matrices
- Choice functions with states of mind
This page was built for publication: Choice functions over a finite set: A summary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1064952)