The following pages link to (Q3624140):
Displayed 30 items.
- Distributed fair allocation of indivisible goods (Q343902) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- Compactly representing utility functions using weighted goals and the Max aggregator (Q622111) (← links)
- The efficiency of fair division (Q692886) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- A general branch-and-bound algorithm for fair division problems (Q991365) (← links)
- Modelling incomplete information in Boolean games using possibilistic logic (Q1726370) (← links)
- Handling preferences in student-project allocation (Q1730741) (← links)
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
- Envy-free allocations respecting social networks (Q2124438) (← links)
- Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
- Multi-unit assignment under dichotomous preferences (Q2173167) (← links)
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity (Q2271865) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Worst case compromises in matroids with applications to the allocation of indivisible goods (Q2346382) (← links)
- Dividing bads under additive utilities (Q2417409) (← links)
- Fair allocation of indivisible goods: the two-agent case (Q2453428) (← links)
- Approximate competitive equilibrium with generic budget (Q2670929) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- Almost Envy-Freeness with General Valuations (Q5107066) (← links)
- Coalition formation in social environments with logic-based agents1 (Q5145446) (← links)
- Fair Division (Q5150295) (← links)
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences (Q6109539) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences (Q6188265) (← links)
- Maximizing Social Welfare in Score-Based Social Distance Games (Q6199615) (← links)