Complexity and approximability of egalitarian Nash product social welfare optimization in multiagent resource allocation

zbMATH Open1394.68395MaRDI QIDQ4583955FDOQ4583955

Authors: Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe 

Publication date: 29 August 2018

Full work available at URL: http://ebooks.iospress.nl/volumearticle/6916

Recommendations

• A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
• Maximizing Nash product social welfare in allocating indivisible goods
• Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
• The price to pay for forgoing normalization in fair division of indivisible goods
• Approximating the Nash Social Welfare with Indivisible Items

zbMATH Keywords

computational complexityauctionsmultiagent resource allocationapproximabilityeconomically motivated agentssocial welfare optimization

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Agent technology and artificial intelligence (68T42)

Cited In (3)

• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
• A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation

This page was built for publication: Complexity and approximability of egalitarian Nash product social welfare optimization in multiagent resource allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583955)