Pages that link to "Item:Q2030716"
From MaRDI portal
The following pages link to Complexity of finding Pareto-efficient allocations of highest welfare (Q2030716):
Displaying 10 items.
- A pessimist's approach to one-sided matching (Q2103007) (← links)
- Minimal envy and popular matchings (Q2242327) (← links)
- Efficient reallocation under additive and responsive preferences (Q2272381) (← links)
- New algorithm for checking Pareto optimality in bimatrix games (Q2678596) (← links)
- (Q3487147) (← links)
- Placement Optimization in Refugee Resettlement (Q5031637) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- Optimization methods and algorithms (Q6536473) (← links)
- Computational complexity of \(k\)-stable matchings (Q6546302) (← links)
- On Pareto optimal balanced exchanges (Q6564189) (← links)