Algorithmic solutions for envy-free cake cutting
From MaRDI portal
(Redirected from Publication:4909115)
Recommendations
Cited in
(42)- On finding an envy-free Pareto-optimal division
- An improved envy-free cake cutting protocol for four agents
- Expand the shares together: envy-free mechanisms with a small number of cuts
- Almost envy-free allocations with connected bundles
- The complexity of finding fair independent sets in cycles
- Two's company, three's a crowd: consensus-halving for a constant number of agents
- Envy-free division of multi-layered cakes
- Cake cutting with single-peaked valuations
- The Hairy Ball problem is PPAD-complete
- Envy-free cake division without assuming the players prefer nonempty pieces
- Cake cutting: explicit examples for impossibility results
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
- Envy-Free Division of Land
- Meta-Envy-Free Cake-Cutting Protocols
- Cutting a Cake for Five People
- Strategy-proof cake cutting mechanisms for all-or-nothing utility
- A note on envy-free cake cutting with polynomial valuations
- Fairly allocating many goods with few queries
- Dynamic fair resource division
- Almost envy-free allocations with connected bundles
- Contiguous cake cutting: hardness results and approximation algorithms
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
- Fair Cake Division Under Monotone Likelihood Ratios
- Fully polynomial-time approximation schemes for fair rent division
- Consensus Halving for Sets of Items
- Consensus-Halving: Does It Ever Get Easier?
- Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts
- On existence of truthful fair cake cutting mechanisms
- A discrete and bounded locally envy-free cake cutting protocol on trees
- Logarithmic algorithms for fair division problems
- Proportional allocations of multi-layered cakes
- Envy-free cake-cutting for four agents
- The efficiency of fair division
- The circular balancing problem
- Pure-circuit: tight inapproximability for PPAD
- Separations in proof complexity and TFNP
- Computing approximate roots of monotone functions
- The complexity of finding fair independent sets in cycles
- Assessing risky weighting functions for positive and negative binary gambles using the logarithmic derivative function
- Fair and efficient cake division with connected pieces
This page was built for publication: Algorithmic solutions for envy-free cake cutting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909115)
