120 citations · 268 across the 16 of their papers we have counts for
4 papers · 1 filter
Scheduling with Time Dependent Utilities: Fairness and Efficiency
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
A new class of multi agent single machine scheduling problems is introduced, where each job is associated with a self interested agent with a utility function decreasing in complet…
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction
Nina Chiarelli, Clément Dallard, Andreas Darmann +4
Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the i…
The Shortest Connection Game
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
We introduce Shortest Connection Game, a two-player game played on a directed graph with edge costs. Given two designated vertices in which they start, the players take turns in ch…
Price of Fairness for Allocating a Bounded Resource
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
In this paper we study the problem of allocating a scarce resource among several players (or agents). A central decision maker wants to maximize the total utility of all agents. Ho…