Approximation Algorithms for Envy-Free Cake Division with Connected Pieces.
Siddharth BarmanPooja KulkarniPublished in: ICALP (2023)
Keyphrases
- approximation algorithms
- envy free
- resource allocation
- np hard
- utility function
- pareto optimal
- worst case
- special case
- minimum cost
- vertex cover
- set cover
- approximation ratio
- connected components
- social welfare
- combinatorial auctions
- envy freeness
- constant factor
- polynomial time approximation
- fixed point
- open shop
- primal dual
- randomized algorithms
- scheduling problem
- disjoint paths
- multi objective
- optimal solution
- decision makers