Pages that link to "Item:Q899158"
From MaRDI portal
The following pages link to Fair assignment of indivisible objects under ordinal preferences (Q899158):
Displaying 19 items.
- Proportional Borda allocations (Q682476) (← links)
- A note on the undercut procedure (Q904826) (← links)
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
- Serial rules in a multi-unit Shapley-Scarf market (Q2100651) (← links)
- Envy-free allocations respecting social networks (Q2124438) (← links)
- Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
- Size versus truthfulness in the house allocation problem (Q2319628) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Multi resource allocation with partial preferences (Q2680798) (← links)
- Allocating indivisible items with minimum dissatisfaction on preference graphs (Q2695444) (← links)
- Competitive Equilibrium with Indivisible Goods and Generic Budgets (Q4991681) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Almost Envy-Freeness with General Valuations (Q5107066) (← links)
- Obtaining a proportional allocation by deleting items (Q5925523) (← links)
- On fair division with binary valuations respecting social networks (Q6102283) (← links)
- Approximate and strategyproof maximin share allocation of chores with ordinal preferences (Q6120928) (← links)
- Computational complexity of necessary envy-freeness (Q6125946) (← links)
- Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)