Anand Krishna
Anand Krishna
Home
Publications
Experience
Contact
Light
Dark
Automatic
Computer Science and Game Theory
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations
We develop polynomial-time algorithms for the fair and efficient allocation of indivisible goods among $n$ agents that have subadditive …
Siddharth Barman
,
Umang Bhaskar
,
Anand Krishna
,
Ranjani G. Sundaram
PDF
Cite
Slides
Video
Cite
×