Pages that link to "Item:Q899158"

The following pages link to Fair assignment of indivisible objects under ordinal preferences (Q899158):

Displaying 34 items.

• Proportional Borda allocations (Q682476) (← links)
• A note on the undercut procedure (Q904826) (← links)
• Social orderings for the assignment of indivisible objects (Q960253) (← links)
• Fair solutions to the random assignment problem (Q1633672) (← links)
• The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
• Picking sequences and monotonicity in weighted fair division (Q2060703) (← links)
• Serial rules in a multi-unit Shapley-Scarf market (Q2100651) (← links)
• A new fairness notion in the assignment of indivisible resources (Q2108757) (← links)
• Envy-free allocations respecting social networks (Q2124438) (← links)
• Minimal envy and popular matchings (Q2242327) (← links)
• Democratic fair allocation of indivisible goods (Q2289012) (← 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)
• Envy-freeness in house allocation problems (Q2334840) (← links)
• Random assignments on preference domains with a tier structure (Q2338670) (← links)
• Size versus fairness in the assignment problem (Q2343388) (← links)
• A general equivalence theorem for allocation of indivisible objects (Q2444698) (← 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)
• Fair in the Eyes of Others (Q5870502) (← links)
• Obtaining a proportional allocation by deleting items (Q5925523) (← links)
• On fair division with binary valuations respecting social networks (Q6102283) (← links)
• Fairness in temporal slot assignment (Q6109542) (← 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)
• Envy-free relaxations for goods, chores, and mixed items (Q6548959) (← links)
• Collective decision making (Q6602233) (← links)
• Ex ante and ex post envy-freeness on polytope resources (Q6671889) (← links)