Rebecca Reiffenhäuser

Envy Cycle Elimination with Strategic Agents: Best Responses and Fairness Guarantees

Georgios Amanatidis, Georgios Birmpas, Rebecca Reiffenhäuser

With strong evidence in the literature showing that fairness and truthfulness are incompatible, there is a recent line of work focusing on the fairness properties of equilibria of simple fair division mechanisms, especially Round-Robin. We consider the Envy Cycle Elimination (E-C-E) procedure …

gr, gb, nl (code pays fourni par la source)

Pandora’s Box Problem Over Time

Georgios Amanatidis, Federico Fusco, Rebecca Reiffenhäuser, Artem Tsikiridis

gb, gr, it, nl (code pays fourni par la source)

Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity

Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi et autres

gb, gr, nl, it, fr (code pays fourni par la source)

Pandora's box problem with time constraints

Georgios Amanatidis, Ben Berger, Tomer Ezra, Michal Feldman et autres

gr, us, il, it, nl, de (code pays fourni par la source)

Online Combinatorial Allocation with Interdependent Values

Michal Feldman, Simon Mauras, Divyarthi Mohan, Rebecca Reiffenhäuser

We study online combinatorial allocation problems in the secretary setting, under interdependent values. In the interdependent model, introduced by Milgrom and Weber (1982), each agent possesses a private signal that captures her information about an item for sale, and the value of …

il, fr, us, nl (code pays fourni par la source)

Algorithmically Fair Maximization of Multiple Submodular Objective Functions

Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi et autres

Constrained maximization of submodular functions poses a central problem in combinatorial optimization. In many realistic scenarios, a number of agents need to maximize multiple submodular objectives over the same ground set. We study such a setting, where the different solutions must be …

gr, gb, kr, it, nl (code pays fourni par la source)

Prophet Inequalities via the Expected Competitive Ratio

Tomer Ezra, Stefano Leonardi, Rebecca Reiffenhäuser, M.V. Russo et autres

We consider prophet inequalities under general downward-closed constraints. In a prophet inequality problem, a decision-maker sees a series of online elements with values and needs to decide immediately and irrevocably whether or not to select each element upon its arrival, subject to …

us, it, nl, de (code pays fourni par la source)

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria

Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi et autres

Fair allocation of indivisible goods has attracted extensive attention over the last two decades, yielding numerous elegant algorithmic results and producing challenging open questions. The problem becomes much harder in the presence of strategic agents. Ideally, one would want to design truthful …

gb, gr, it, nl (code pays fourni par la source)

Online Combinatorial Allocations and Auctions with Few Samples

Paul Dütting, Thomas Keßelheim, Brendan Lucier, Rebecca Reiffenhäuser et autres

In online combinatorial allocations/auctions,$n$bidders sequentially arrive, each with a combinatorial valuation (such as submodular/XOS) over subsets of$m$indivisible items. The aim is to immediately allocate a subset of the remaining items to maximize the total welfare, defined as the sum of bidder valuations. …

ch, de, us, nl (code pays fourni par la source)

Online Combinatorial Allocations and Auctions with Few Samples

Paul Dütting, Thomas Keßelheim, Brendan Lucier, Rebecca Reiffenhäuser et autres

In online combinatorial allocations/auctions, n bidders sequentially arrive, each with a combinatorial valuation (such as submodular/XOS) over subsets of m indivisible items. The aim is to immediately allocate a subset of the remaining items to maximize the total welfare, defined as the …

Optimal Stopping with Interdependent Values

Simon Mauras, Divyarthi Mohan, Rebecca Reiffenhäuser

We study online selection problems in both the prophet and secretary settings, when arriving agents have interdependent values. In the interdependent values model, introduced in the seminal work of Milgrom and Weber [1982], each agent has a private signal and the value …

fr, il, nl (code pays fourni par la source)

Optimal Stopping with Interdependent Values

Simon Mauras, Divyarthi Mohan, Rebecca Reiffenhäuser

We study online selection problems in both the prophet and secretary settings, when arriving agents have interdependent values. In the interdependent values model, introduced in the seminal work of Milgrom and Weber [1982], each agent has a private signal and the value …