Pages that link to "Item:Q2259025"
From MaRDI portal
The following pages link to Finding maxmin allocations in cooperative and competitive fair division (Q2259025):
Displaying 9 items.
- A general branch-and-bound algorithm for fair division problems (Q991365) (← links)
- \(\alpha \)-maxmin solutions to fair division problems and the structure of the set of Pareto utility profiles (Q1013524) (← links)
- An algorithm for identifying fair and optimal allocations (Q1934132) (← links)
- Some solutions for generalized games with restricted cooperation (Q2095953) (← links)
- How to obtain an equitable optimal fair division (Q2288973) (← links)
- Fair cake-cutting among families (Q2296036) (← links)
- Monotonicity and competitive equilibrium in cake-cutting (Q2323302) (← links)
- Bounds for \(\alpha\)-optimal partitioning of a measurable space based on several efficient partitions (Q2512678) (← links)
- Maximin share based mechanisms for multi-resource fair allocation with divisible and indivisible tasks (Q6535287) (← links)