15 citations · 32 across the 9 of their papers we have counts for
9 papers
EF1 and EFX Orientations
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith +1
We study the problem of finding fair allocations -- EF1 and EFX -- of indivisible goods with orientations. In an orientation, every agent gets items from their own predetermined se…
How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
Argyrios Deligkas, Michelle Döring, Eduard Eiben +3
Logistics and transportation networks require a large amount of resources to realize necessary connections between locations and minimizing these resources is a vital aspect of pla…
Individual Rationality in Topological Distance Games is Surprisingly Hard
Argyrios Deligkas, Eduard Eiben, Dušan Knop +1
In the recently introduced topological distance games, strategic agents need to be assigned to a subset of vertices of a topology. In the assignment, the utility of an agent depend…
Some coordination problems are harder than others
Argyrios Deligkas, Eduard Eiben, Gregory Gutin +2
In order to coordinate players in a game must first identify a target pattern of behaviour. In this paper we investigate the difficulty of identifying prominent outcomes in two kin…
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems
Argyrios Deligkas, Eduard Eiben, Gregory Gutin +2
We investigate the difficulty of finding economically efficient solutions to coordination problems on graphs. Our work focuses on two forms of coordination problem: pure-coordinati…
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source
Argyrios Deligkas, Michelle Döring, Eduard Eiben +2
We consider the influence maximization problem over a temporal graph, where there is a single fixed source. We deviate from the standard model of influence maximization, where the…