21 citations · 65 across the 25 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.GT2017
Computing Constrained Approximate Equilibria in Polymatrix Games
Argyrios Deligkas, John Fearnley, Rahul Savani
This paper is about computing constrained approximate Nash equilibria in polymatrix games, which are succinctly represented many-player games defined by an interaction graph betwee…
cs.DS2017
Binary Search in Graphs Revisited
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
In the classical binary search in a path the aim is to detect an unknown target by asking as few queries as possible, where each query reveals the direction to the target. This bin…