Counting combinatorial choice rules

DOI10.1016/j.geb.2006.03.009zbMath1168.91348OpenAlexW2126352844MaRDI QIDQ876881

Federico Echenique

Publication date: 19 April 2007

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20170731-131625843

zbMATH Keywords

independence of irrelevant alternativescommunication complexitymatching marketschoice rulessubstitutabilityrationalizabilty

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Social choice (91B14) Matching models (91B68)

Related Items (12)

A cumulative offer process for supply chain networks ⋮ A solution to matching with preferences over colleagues ⋮ Resolutions of convex geometries ⋮ Complexity of stability in trading networks ⋮ WARP and combinatorial choice ⋮ The communication requirements of social choice rules and supporting budget sets ⋮ A college admissions clearinghouse ⋮ Set and revealed preference axioms for multi-valued choice ⋮ Unified versus divided enrollment in school choice: improving student welfare in Chicago ⋮ Affinely representable lattices, stable matchings, and choice functions ⋮ Choice functions and extensive operators ⋮ Efficiency and stability under substitutable priorities with ties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nontransitive-nontotal consumer theory
• An asymptotic equivalent for the number of total preorders on a finite set
• A computation of the eighth Dedekind number
• Buying several indivisible goods
• Walrasian equilibrium with gross substitutes
• The English auction with differentiated commodities
• The number of weak orderings of a finite set
• The communication requirements of social choice rules and supporting budget sets
• Stability and Polarization of Interests in Job Matching
• The Lattice Structure of the Set of Stable Matchings with Multiple Partners
• Preferential Arrangements
• Job Matching, Coalition Formation, and Gross Substitutes
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• A Note on Kelso and Crawford's Gross Substitutes Condition
• Rational Selection of Decision Functions

This page was built for publication: Counting combinatorial choice rules