2 citations · 8 across the 15 of their papers we have counts for
6 papers · 1 filter
Dividing Indivisible Items for the Benefit of All: It is Hard to Be Fair Without Social Awareness
Argyris Deligkas, Eduard Eiben, Tiger-Lily Goldsmith +2
In standard fair division models, we assume that all agents are selfish. However, in many scenarios, division of resources has a direct impact on the whole group or even society. T…
When Agents Break Down in Multiagent Path Finding
Foivos Fioravantes, Dušan Knop, Nikolaos Melissinos +1
In Multiagent Path Finding (MAPF), the goal is to compute efficient, collision-free paths for multiple agents navigating a network from their sources to targets, minimizing the sch…
Density of Traceable Graphs
Michal Dvořák, Dušan Knop, Michal Opler +3
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show…
Balanced and Fair Partitioning of Friends
Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis +2
In the recently introduced model of fair partitioning of friends, there is a set of agents located on the vertices of an underlying graph that indicates the friendships between the…
Practical approach to -Euclidean Preferences
Michal Dvořák, Dušan Knop, Jan Pokorný +1
An election is a pair of candidates and voters. Each vote is a ranking (permutation) of the candidates. An election is -Euclidean if there is an embedding of both candid…
Exact Algorithms for Distance to Unique Vertex Cover
Foivos Fioravantes, Dušan Knop, Nikolaos Melissinos +2
Horiyama et al. (AAAI 2024) studied the problem of generating graph instances that possess a unique minimum vertex cover under specific conditions. Their approach involved pre-assi…