Approximation Algorithms for Envy-Free Cake Division with Connected Pieces.
Siddharth BarmanPooja KulkarniPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- envy free
- resource allocation
- pareto optimal
- np hard
- utility function
- special case
- worst case
- minimum cost
- vertex cover
- envy freeness
- set cover
- social welfare
- connected components
- primal dual
- open shop
- undirected graph
- reinforcement learning
- multi objective
- randomized algorithms
- precedence constraints
- constant factor approximation
- evolutionary algorithm