A
Argyrios Deligkas
Researcher at Royal Holloway, University of London
Publications - 61
Citations - 447
Argyrios Deligkas is an academic researcher from Royal Holloway, University of London. The author has contributed to research in topics: Nash equilibrium & Stochastic game. The author has an hindex of 11, co-authored 61 publications receiving 347 citations. Previous affiliations of Argyrios Deligkas include Technion – Israel Institute of Technology & University of Liverpool.
Papers
More filters
Posted Content
Revenue Maximization via Hiding Item Attributes
Mingyu Guo,Argyrios Deligkas +1 more
TL;DR: It is shown that it is NP-hard to compute the optimal attribute hiding scheme, and a polynomial-time solvable upper bound on the optimal revenue is derived.
Posted Content
Computing Approximate Nash Equilibria in Polymatrix Games
TL;DR: In this article, it was shown that for polymatrix games, the Nash equilibrium can be computed in time polynomial in the input size and in the regret of the players.
Proceedings Article
Heterogeneous Facility Location Games
TL;DR: The goal is to design strategy proof mechanisms that locate the facilities in a way to maximize the minimum utility among the agents, and some of the mechanisms can be used to achieve constant factor approximations for other objectives as the social welfare and the happiness.
Journal ArticleDOI
Distributed Methods for Computing Approximate Equilibria
Artur Czumaj,Argyrios Deligkas,Michail Fasoulakis,Michail Fasoulakis,John Fearnley,Marcin Jurdziński,Rahul Savani +6 more
TL;DR: A new, distributed method to compute approximate Nash equilibria in bimatrix games that first solves two independent LPs, each of which is derived from one of the two payoff matrices, and then computes an approximate Nash equilibrium using only limited communication between the players.
Journal ArticleDOI
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
TL;DR: A new complexity class is defined, called BU, which captures all problems that can be reduced to solving an instance of the Borsuk-Ulam problem exactly, and that LinearBU = PPA, where LinearBU is the subclass of BU in which the BORSuk- Ulam instance is specified by a linear arithmetic circuit.