Pages that link to "Item:Q2999165"

The following pages link to Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods (Q2999165):

Displaying 25 items.

• A divisor apportionment method based on the Kolm-Atkinson social welfare function and generalized entropy (Q433816) (← links)
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
• Verification in incomplete argumentation frameworks (Q668774) (← 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)
• \(\alpha \)-maxmin solutions to fair division problems and the structure of the set of Pareto utility profiles (Q1013524) (← links)
• Impossibilities for probabilistic assignment (Q1697833) (← links)
• Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences (Q1786741) (← links)
• On the computability of equitable divisions (Q1926490) (← 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)
• Democratic fair allocation of indivisible goods (Q2289012) (← links)
• Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
• Computing a small agreeable set of indivisible items (Q2321268) (← links)
• Multi resource allocation with partial preferences (Q2680798) (← links)
• (Q4608059) (← links)
• Fair Division (Q5150295) (← links)
• An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities (Q6074887) (← links)
• Ordinal optimization through multi-objective reformulation (Q6096566) (← 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)
• Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)
• Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items (Q6488080) (← links)
• Ex ante and ex post envy-freeness on polytope resources (Q6671889) (← links)