Pages that link to "Item:Q1290667"
From MaRDI portal
The following pages link to On finding an envy-free Pareto-optimal division (Q1290667):
Displaying 15 items.
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- On the fair division of a heterogeneous commodity (Q1198380) (← links)
- Competitive envy-free division (Q1767292) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- On the existence of Pareto efficient and envy-free allocations (Q2025008) (← links)
- Finding maxmin allocations in cooperative and competitive fair division (Q2259025) (← links)
- Monotonicity and competitive equilibrium in cake-cutting (Q2323302) (← links)
- An algorithm for envy-free allocations in an economy with indivisible objects and money (Q2388747) (← links)
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation (Q2661522) (← links)
- Envy-Free Division of Land (Q3387907) (← links)
- (Q4608059) (← links)
- Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
- Finding the Pareto optimal equitable allocation of homogeneous divisible goods among three players (Q5228474) (← links)
- ENVY‐FREE DIVISION USING MAPPING DEGREE (Q6072663) (← links)
- Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items (Q6488080) (← links)