Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"Nash Social Welfare"”.
-
Algorithms and complexity results for problems on fair division and imitation games
… EFX, PO and gives a 1.067-approximation to the Nash Social Welfare (NSW) can be computed in polynomial time. We also present algorithms that satisfy a different notions of fairness, like equitability up to one good (EQ1), and equitability up to any good (EQX) along with PO in some of these …
-
Subset Selection via Spectral Objectives
… we consider the special case of the weighted Nash Social Welfare problem. This problem has its own specially-tailored relaxations, which we use to construct a new approximation algorithm. Then, we turn to the minimum eigenvalue problem with general matroid constraints. By modifying the natural …
-
Algorithms for fair division through competitive equilibrium
… classical Lemke-Howson algorithm for computing a Nash equilibrium in a two player game is still the most widely used algorithm. My algorithm also yields several new structural properties of CE as simple corollaries. I obtain constructive proof of existence for a far more general setting, …