4 citations · 5 across the 4 of their papers we have counts for
4 papers
Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity
Ioannis Caragiannis, Kurt Mehlhorn, Nidhi Rathi
Serial dictatorship is a simple mechanism for coordinating agents in solving combinatorial optimization problems according to their preferences. The most representative such proble…
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations
Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin +1
We consider the problem of guaranteeing maximin-share (MMS) when allocating a set of indivisible items to a set of agents with fractionally subadditive (XOS) valuations. For XOS va…
Fair and Efficient Allocation of Indivisible Chores with Surplus
Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg +2
We study fair division of indivisible chores among agents with additive disutility functions. Two well-studied fairness notions for indivisible items are envy-freeness up to on…
Cache-Oblivious VAT-Algorithms
Tomasz Jurkiewicz, Kurt Mehlhorn, Patrick Nicholson
The VAT-model (virtual address translation model) extends the EM-model (external memory model) and takes the cost of address translation in virtual memories into account. In this m…