14 citations · 49 across the 47 of their papers we have counts for
Showing 2026 · cs.GTShow all
2 papers · 2 filters
cs.GT2026
Network Allocation Games with Anonymous Preferences
Argyrios Deligkas, Eduard Eiben, Šimon Schierreich +1
We study network allocation games in which a set of agents must be allocated to (a subset of) the vertices of a graph topology. The agents are anonymous and strategic: Each of them…
cs.GT2026
Stability in Distance Preservation Games on Graphs
Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith +2
We introduce a new class of network allocation games called graphical distance preservation games. Here, we are given a graph, called a topology, and a set of agents that need to b…