Pages that link to "Item:Q5361851"
From MaRDI portal
The following pages link to A discrete and bounded envy-free cake cutting protocol for four agents (Q5361851):
Displaying 32 items.
- A note on envy-free cake cutting with polynomial valuations (Q477590) (← links)
- Fair and efficient cake division with connected pieces (Q776236) (← links)
- Which is the fairest allocation in the max-min fairness-based coalitional game? (Q820567) (← links)
- Truthful fair division without free disposal (Q826615) (← links)
- Expand the shares together: envy-free mechanisms with a small number of cuts (Q1739119) (← links)
- Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks (Q1755749) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Envy-free division of multi-layered cakes (Q2152142) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Fair division of mixed divisible and indivisible goods (Q2238609) (← links)
- How to share a cake with a secret agent (Q2334821) (← links)
- Cake cutting: explicit examples for impossibility results (Q2334852) (← links)
- Fair multi-cake cutting (Q2659057) (← links)
- Two birds with one stone: fairness and welfare via transfers (Q2670942) (← links)
- Fair cake-cutting in practice (Q2673204) (← links)
- Fair Division and Generalizations of Sperner- and KKM-type Results (Q4604649) (← links)
- Fairly Allocating Many Goods with Few Queries (Q4986810) (← links)
- Dynamic Fair Resource Division (Q5085123) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← links)
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol (Q5146918) (← links)
- Fair Division (Q5150295) (← links)
- Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Fairly taking turns (Q6148409) (← links)
- On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)
- An iterative procedure for apportionment and its use in the 2016 Georgia Republican primary (Q6494746) (← links)
- Maximize egalitarian welfare for cake cutting (Q6535822) (← links)
- EFX allocations for indivisible chores: matching-based approach (Q6546298) (← links)
- The frontier of intractability for EFX with two agents (Q6546301) (← links)
- A discrete and bounded locally envy-free cake cutting protocol on trees (Q6609151) (← links)
- Approximate envy-freeness in graphical cake cutting (Q6611013) (← links)
