120 citations · 268 across the 16 of their papers we have counts for
6 papers · 1 filter
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
Nina Chiarelli, Clément Dallard, Andreas Darmann +4
We consider the task of allocating indivisible items to agents, when the agents' preferences over the items are identical. The preferences are captured by means of a directed acycl…
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints
Nina Chiarelli, Matjaž Krnc, Martin Milanič +2
We consider the fair allocation of indivisible items to several agents with additional conflict constraints. These are represented by a conflict graph where each item corresponds t…
Fair allocation of indivisible items with conflict graphs
Nina Chiarelli, Matjaž Krnc, Martin Milanič +3
We consider the fair allocation of indivisible items to several agents and add a graph theoretical perspective to this classical problem. Namely, we introduce an incompatibility re…
Geometric and LP-based heuristics for the quadratic travelling salesman problem
Rostislav Staněk, Peter Greistorfer, Klaus Ladner +1
A generalization of the classical TSP is the so-called quadratic travelling salesman problem (QTSP), in which a cost coefficient is associated with the transition in every vertex,…
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…
On the shortest path game: extended version
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
In this work we address a game theoretic variant of the shortest path problem, in which two decision makers (players) move together along the edges of a graph from a given starting…