ScholarLens Back to search
2015•ACM SIGecom ExchangesRequires access

Approximating the nash social welfare with indivisible items

Richard Cole, Vasilis Gkatzelis

Open publisher page 15 citations

Abstract

In this letter we briefly discuss our main result from [Cole and Gkatzelis 2015]. Given a set of indivisible items and a set of agents having additive valuations, our goal is to allocate the items to the agents in order to maximize the geometric mean of the agents' valuations, i.e., the Nash social welfare. This problem is known to be NP-hard, and our main result is the first efficient constant-factor approximation algorithm for this objective.

About this research paper

What this paper is about

In this letter we briefly discuss our main result from [Cole and Gkatzelis 2015]. Given a set of indivisible items and a set of agents having additive valuations, our goal is to allocate the items to the agents in order to maximize the geometric mean of the agents' valuations, i.e., the Nash social welfare. This problem is known to be NP-hard, and our main result is the first efficient constant-factor approximation algorithm for this objective.

Why it matters

OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this letter we briefly discuss our main result from [Cole and Gkatzelis 2015]. Given a set of indivisible items and a set of agents having additive valuations, our goal is to allocate the items to the agents in order to maximize the geometric mean of the agents' valuations, i.e., the Nash social welfare. This problem is known to be NP-hard, and our main result is the first efficient constant-factor approximation algorithm for this objective.

Key concepts: Mathematical economics, Set (abstract data type), Nash equilibrium, Social Welfare, Order (exchange), Social choice theory, Constant (computer programming), Welfare

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Approximating the nash social welfare with indivisible items — Research Paper | ScholarLens