Pages that link to "Item:Q1876633"
From MaRDI portal
The following pages link to Fair division of indivisible items (Q1876633):
Displaying 39 items.
- Maximizing Nash product social welfare in allocating indivisible goods (Q320030) (← links)
- Implementing equal division with an ultimatum threat (Q490057) (← links)
- How to divide the indivisible (Q521428) (← links)
- Proportional Borda allocations (Q682476) (← links)
- Two-player fair division of indivisible items: comparison of algorithms (Q724147) (← links)
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- Brams-Taylor model of fair division for divisible and indivisible items (Q991311) (← links)
- A general branch-and-bound algorithm for fair division problems (Q991365) (← links)
- Equitable distribution of indivisible objects (Q1107410) (← links)
- Welfare bounds in the fair division problem (Q1176682) (← links)
- Buying several indivisible goods (Q1296506) (← links)
- On fair compensation (Q1325794) (← links)
- Strategy-proofness of scoring allocation correspondences for indivisible goods (Q1707112) (← links)
- Fair division with no information (Q1770142) (← links)
- Games of fair division (Q1893376) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Efficient reallocation under additive and responsive preferences (Q2272381) (← links)
- Dividing splittable goods evenly and with limited fragmentation (Q2309472) (← links)
- Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
- Using the Borda rule for ranking sets of objects (Q2325666) (← links)
- Fair sharing under dichotomous preferences (Q2343801) (← links)
- Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity (Q2388751) (← links)
- The undercut procedure: an algorithm for the envy-free division of indivisible items (Q2450092) (← links)
- Fair allocation of indivisible goods: the two-agent case (Q2453428) (← links)
- How to allocate hard candies fairly (Q2463574) (← links)
- Fair (and not so fair) division (Q2479876) (← links)
- A simple procedure for finding equitable allocations of indivisible goods (Q2567921) (← links)
- Money-egalitarian-equivalent and gain-maximin allocations of indivisible items with monetary compensation (Q2568800) (← links)
- On fairness via picking sequences in allocation of indivisible goods (Q2695445) (← links)
- How to Divide Things Fairly (Q2956577) (← links)
- Truthful Fair Division (Q3162527) (← links)
- Dividing splittable goods evenly and with limited fragmentation (Q5111223) (← links)
- Fair Allocation of Indivisible Goods (Q5133015) (← links)
- Fair Division (Q5150295) (← links)
- Fairly allocating contiguous blocks of indivisible items (Q5894699) (← links)
- Obituary: Peter C. Fishburn (1936--2021) (Q5918750) (← links)
- Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
- A characterization of the existence of succinct linear representation of subset-valuations (Q6167805) (← links)
