The following pages link to (Q4221107):
Displaying 50 items.
- Dissolving a partnership dynamically (Q337803) (← links)
- A heuristic optimization of Bayesian incentive-compatible cake-cutting (Q342509) (← links)
- Distributed fair allocation of indivisible goods (Q343902) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- A note on envy-free cake cutting with polynomial valuations (Q477590) (← links)
- Two-person cake cutting: the optimal number of cuts (Q483349) (← links)
- On fair division of a homogeneous good (Q485780) (← links)
- Dividing connected chores fairly (Q500994) (← links)
- The language of social software (Q625718) (← links)
- The efficiency of fair division (Q692886) (← links)
- Extremal problems for hypotheses testing with set-valued decisions (Q726584) (← links)
- Fair and efficient cake division with connected pieces (Q776236) (← links)
- Truthful fair division without free disposal (Q826615) (← links)
- Children crying at birthday parties. Why? (Q878403) (← links)
- Analysis of OWA operators in decision making for modelling the majority concept (Q884582) (← links)
- Strategic divide and choose (Q952777) (← links)
- Disputed lands (Q1021584) (← links)
- Maximin share and minimax envy in fair-division problems. (Q1399324) (← links)
- How to cut a cake with a Gram matrix (Q1625485) (← links)
- Sequential analogues of the Lyapunov and Krein-Milman theorems in Fréchet spaces (Q1683196) (← links)
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond (Q1763188) (← links)
- Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715) (← links)
- On the computability of equitable divisions (Q1926490) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Mind the gap: cake cutting with separation (Q2093384) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Obvious manipulations in cake-cutting (Q2103594) (← links)
- Cutting a cake for infinitely many guests (Q2121781) (← links)
- Envy-free allocations respecting social networks (Q2124438) (← links)
- Dissolving a partnership securely (Q2175968) (← links)
- Fairness and efficiency in cake-cutting with single-peaked preferences (Q2180735) (← links)
- The fair division of hereditary set systems (Q2190407) (← links)
- Fair division with multiple pieces (Q2192068) (← links)
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination (Q2202022) (← links)
- Fair division of mixed divisible and indivisible goods (Q2238609) (← links)
- Fair allocation of indivisible goods with minimum inequality or minimum envy (Q2242281) (← links)
- Two-player envy-free multi-cake division (Q2270332) (← links)
- Fair cake-cutting among families (Q2296036) (← links)
- The return function: a new computable perspective on Bayesian-Nash equilibria (Q2312340) (← links)
- Cake-cutting with different entitlements: how many cuts are needed? (Q2325916) (← links)
- How to share a cake with a secret agent (Q2334821) (← links)
- Cake cutting: explicit examples for impossibility results (Q2334852) (← links)
- An equilibrium analysis of Knaster's fair division procedure (Q2351206) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- Existence of a simple and equitable fair division: a short proof (Q2406943) (← links)
- On the complexity of cake cutting (Q2467132) (← links)
- Fair (and not so fair) division (Q2479876) (← links)
- Proportional pie-cutting (Q2482667) (← links)
- A paradoxical Pareto frontier in the cake-cutting context (Q2573268) (← links)
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting (Q2629532) (← links)
