Pages that link to "Item:Q1729666"
From MaRDI portal
The following pages link to Matching with single-peaked preferences (Q1729666):
Displaying 11 items.
- Object reallocation problems under single-peaked preferences: two characterizations of the crawler (Q2100102) (← links)
- On obviously strategy-proof implementation of fixed priority top trading cycles with outside options (Q2126158) (← links)
- Probabilistic fixed ballot rules and hybrid domains (Q2138383) (← links)
- Pareto rationalizability by two single-peaked preferences (Q2153911) (← links)
- The crawler: three equivalence results for object (re)allocation problems when preferences are single-peaked (Q2155231) (← links)
- A simple construction of complete single-peaked domains by recursive tiling (Q2283307) (← links)
- When are efficient and fair assignment mechanisms group strategy-proof? (Q2291174) (← links)
- Alternative characterizations of the top trading cycles rule in housing markets (Q2660053) (← links)
- Object reallocation problems with single-dipped preferences (Q6102576) (← links)
- Exchange of indivisible goods under matroid constraints (Q6145529) (← links)
- On a class of strategy-proof social choice correspondences with single-peaked utility functions (Q6146443) (← links)
