… Nash social welfare is known to be APX-hard in general, we study the effectiveness of
simple, greedy algorithms in … First, we show that a simple, greedy algorithm provides a 1.061-…

… Section 4 contains the main positive result of the paper: the Set-Aside Greedy algorithm, that
achieves a competitive ratio of O(log N) and O(log T) for online NSW maximization. Section …

… For the online setting, we analyze the greedy algorithm … greedy algorithm, and we show
that, when considering polynomial latency functions of degreep, there exists no online algorithm …

… Section 4 contains the main positive result of the paper: the Set-Aside Greedy algorithm, that
achieves a competitive ratio of O(log N) and O(log T) for online NSW maximization. Section …

… We also present a polynomial-time algorithm for the case when the number of agents is …
social welfare by the average Nash product. We provide a fast greedy approximation algorithm …

… We consider the problem of maximizing the Nash social welfare when … In this work, we design
an algorithm to compute an optimal … Our algorithm is a greedy procedure and improves this …

… We saw in Proposition 1 that a Nash Equilibrium m can result in zero social welfare if users
are spiteful. In this section, we investigate under what conditions can a fixed point (m, α, S) of …

… algorithm we use Nash Social Welfare Matching which makes a new connection between
Nash Social … example which shows that a Nash Social Welfare allocation is not necessarily …

… To solve the relaxation (approximately), they use an iterated continuous greedy algorithm.
The allocation R is obtained by independent randomized rounding of this fractional solution. …

… Our algorithm for symmetric binary valuations uses the greedy … )-sized bins for the Nash
product and obtain an approximation algorithm. Before we discuss our algorithm, let us introduce …