The following pages link to Counting combinatorial choice rules (Q876881):
Displaying 13 items.
- A cumulative offer process for supply chain networks (Q826047) (← links)
- Choice functions and extensive operators (Q1016094) (← links)
- WARP and combinatorial choice (Q1693195) (← links)
- A college admissions clearinghouse (Q1757598) (← links)
- Set and revealed preference axioms for multi-valued choice (Q2021541) (← links)
- Unified versus divided enrollment in school choice: improving student welfare in Chicago (Q2278933) (← links)
- Efficiency and stability under substitutable priorities with ties (Q2334139) (← links)
- A solution to matching with preferences over colleagues (Q2371150) (← links)
- The communication requirements of social choice rules and supporting budget sets (Q2455666) (← links)
- Resolutions of convex geometries (Q2665967) (← links)
- Affinely representable lattices, stable matchings, and choice functions (Q5925643) (← links)
- Complexity of stability in trading networks (Q6052977) (← links)
- Revealed VNM-solutions: characterizations (Q6545007) (← links)
