activity
20072026
most citedPrice of Fairness for Allocating a Bounded Resource

55 citations · 56 across the 6 of their papers we have counts for

collaborators

7 papers

cs.GT2026

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…

math.OC2024★ 1 cited

Flow Shop Scheduling with Inter-Stage Flexibility and Blocking Constraints

Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy +2

We investigate a scheduling problem arising from a material handling and processing problem in a production line of an Austrian company building prefabricated house walls. The addr…

cs.DS2021

Optimally rescheduling jobs with a LIFO buffer

Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy +2

This paper considers single-machine scheduling problems in which a given solution, i.e. an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. Th…

cs.DM2018

On a Stackelberg Subset Sum Game

Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici

This contribution deals with a two-level discrete decision problem, a so-called Stackelberg strategic game: A Subset Sum setting is addressed with a set of items with given int…

cs.GT2015★ 55 cited

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…

cs.DM2008

Demand allocation with latency cost functions

Alessandro Agnetis, Enrico Grande, Andrea Pacifici

We address the exact resolution of a MINLP model where resources can be activated in order to satisfy a demand (a partitioning constraint) while minimizing total cost. Cost functio…

cs.DM2007

Covering a line segment with variable radius discs

Alessandro Agnetis, Enrico Grande, Pitu B. Mirchandani +1

The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Prob…