Pages that link to "Item:Q2272381"
From MaRDI portal
The following pages link to Efficient reallocation under additive and responsive preferences (Q2272381):
Displaying 14 items.
- Strategy-proofness of scoring allocation correspondences for indivisible goods (Q1707112) (← links)
- Complexity of finding Pareto-efficient allocations of highest welfare (Q2030716) (← links)
- Operations research in Hungary: VOCAL 2018 (Q2045605) (← links)
- Serial rules in a multi-unit Shapley-Scarf market (Q2100651) (← links)
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity (Q2271865) (← links)
- Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity (Q2289006) (← links)
- Refugee allocation in the setting of hedonic games (Q2290371) (← links)
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation (Q2661522) (← links)
- Computing fair and efficient allocations with few utility values (Q2670939) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Computing fair and efficient allocations with few utility values (Q6159026) (← links)
- On best-of-both-worlds fair-share allocations (Q6167252) (← links)
- Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains (Q6565042) (← links)
- Fair division with two-sided preferences (Q6634122) (← links)