14 papers
Individual Rationality in Constrained Hedonic Games: Additively Separable and Fractional Preferences
Foivos Fioravantes, Harmender Gahlawat, Nikolaos Melissinos +1
Hedonic games are an archetypal problem in coalition formation, where a set of selfish agents want to partition themselves into stable coalitions. In this work, we focus on two nat…
Parameterized Critical Node Cut Revisited
Dušan Knop, Nikolaos Melissinos, Manolis Vasilakis
We study how to sparsify connectivity in graphs under a tight deletion budget. Given a graph and integers , Critical Node Cut (CNC) asks whether we can delete at mos…
Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs
Tesshu Hanaka, Nikolaos Melissinos, Hirotaka Ono
Coordinating the movement of multiple autonomous agents over a shared network is a fundamental challenge in algorithmic robotics, intelligent transportation, and distributed system…
Parameterised distance to local irregularity
Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis
A graph is \emph{locally irregular} if no two of its adjacent vertices have the same degree. In [Fioravantes et al. Complexity of finding maximum locally irregular induced subg…
Exact Algorithms for Resource Reallocation Under Budgetary Constraints
Arun Kumar Das, Sandip Das, Sweta Das +2
Efficient resource (re-)allocation is a critical challenge in optimizing productivity and sustainability within multi-party supply networks. In this work, we introduce the \textsc{…
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…