5 citations · 8 across the 8 of their papers we have counts for
19 papers
Maximizing Nash Social Welfare in 2-Value Instances
Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer +6
We consider the problem of maximizing the Nash social welfare when allocating a set of indivisible goods to a set of agents. We study instances, in whic…
Nash Social Welfare for 2-value Instances
Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn +2
This paper is merged with arXiv:2107.08965v2. We refer the reader to the full and updated version. We study the problem of allocating a set of indivisible goods among agents with 2…
Improving EFX Guarantees through Rainbow Cycle Number
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn +2
We study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. Envy-freeness up to any good (EFX) is arguably the most compelling f…
The Maximum-Level Vertex in an Arrangement of Lines
Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn +2
Let be a set of lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement of maximum…
EFX Exists for Three Agents
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn
We study the problem of distributing a set of indivisible items among agents with additive valuations in a manner. The fairness notion under consideration is Envy-f…
Trustworthy Graph Algorithms
Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow
The goal of the LEDA project was to build an easy-to-use and extendable library of correct and efficient data structures, graph algorithms and geometric algorithms. We report on th…