APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items

July 05, 2015 · The Ethereal · 🏛 Information Processing Letters

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Euiwoong Lee arXiv ID 1507.01159 Category cs.CC: Computational Complexity Cross-listed cs.DS, cs.GT Citations 105 Venue Information Processing Letters Last Checked 1 month ago
Abstract
We study the problem of allocating a set of indivisible items to agents with additive utilities to maximize the Nash social welfare. Cole and Gkatzelis recently proved that this problem admits a constant factor approximation. We complement their result by showing that this problem is APX-hard.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Computational Complexity