Pages that link to "Item:Q4909115"

The following pages link to Algorithmic Solutions for Envy-Free Cake Cutting (Q4909115):

Displaying 24 items.

• The efficiency of fair division (Q692886) (← links)
• Assessing risky weighting functions for positive and negative binary gambles using the logarithmic derivative function (Q730176) (← links)
• Fair and efficient cake division with connected pieces (Q776236) (← links)
• Expand the shares together: envy-free mechanisms with a small number of cuts (Q1739119) (← links)
• Almost envy-free allocations with connected bundles (Q2078044) (← links)
• The complexity of finding fair independent sets in cycles (Q2087771) (← 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)
• The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
• Envy-free cake division without assuming the players prefer nonempty pieces (Q2279957) (← links)
• Envy-Free Division of Land (Q3387907) (← links)
• Cutting a Cake for Five People (Q3638457) (← links)
• Fairly Allocating Many Goods with Few Queries (Q4986810) (← links)
• Dynamic Fair Resource Division (Q5085123) (← links)
• (Q5090386) (← links)
• Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
• Fair Cake Division Under Monotone Likelihood Ratios (Q5868939) (← links)
• Fully Polynomial-Time Approximation Schemes for Fair Rent Division (Q5868945) (← links)
• Consensus Halving for Sets of Items (Q5870379) (← links)
• Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)
• Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts (Q6065412) (← links)
• On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)