The following pages link to Algorithms and Computation (Q5897947):
Displaying 15 items.
- Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- Impossibilities for probabilistic assignment (Q1697833) (← links)
- Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences (Q1786741) (← links)
- Complexity of finding Pareto-efficient allocations of highest welfare (Q2030716) (← links)
- Efficient reallocation under additive and responsive preferences (Q2272381) (← links)
- Algorithms for Pareto optimal exchange with bounded exchange cycles (Q2294333) (← links)
- Pareto optimality in coalition formation (Q2437839) (← links)
- Reducing rank-maximal to maximum weight matching (Q2465632) (← links)
- On reachable assignments in cycles (Q2695447) (← links)
- (Q3552447) (← links)
- (Q3604325) (← links)
- Mobile Sensor Networks (Q5178095) (← links)
- Preference Inference Based on Pareto Models (Q5268420) (← links)
- The dynamics of rank-maximal and popular matchings (Q6093577) (← links)