Counting combinatorial choice rules

DOI10.1016/J.GEB.2006.03.009zbMATH Open1168.91348OpenAlexW2126352844MaRDI QIDQ876881FDOQ876881

Authors: 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

Recommendations

• Matroidal choice functions
• Choice function-based two-sided markets: stability, lattice property, path independence and algorithms
• On capacity-filling and substitutable choice rules
• The stable roommates problem with choice functions
• An impossibility theorem for matching problems

zbMATH Keywords

communication complexityindependence of irrelevant alternativeschoice rulessubstitutabilitymatching marketsrationalizabilty

Mathematics Subject Classification ID

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

Cites Work

• Preferential Arrangements
• Title not available (Why is that?)
• Title not available (Why is that?)
• Walrasian equilibrium with gross substitutes
• Title not available (Why is that?)
• Rational Selection of Decision Functions
• Title not available (Why is that?)
• 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
• Stability and Polarization of Interests in Job Matching
• The Lattice Structure of the Set of Stable Matchings with Multiple Partners
• A computation of the eighth Dedekind number
• Buying several indivisible goods
• Nontransitive-nontotal consumer theory
• A Note on Kelso and Crawford's Gross Substitutes Condition
• The English auction with differentiated commodities
• Title not available (Why is that?)
• An asymptotic equivalent for the number of total preorders on a finite set
• The number of weak orderings of a finite set
• The communication requirements of social choice rules and supporting budget sets

Cited In (14)

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

This page was built for publication: Counting combinatorial choice rules

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