21 citations · 29 across the 12 of their papers we have counts for
15 papers
The Complexity of KKT Points of Quadratic Programs with Polynomially-Bounded Coefficients
Argyrios Deligkas, Michail Fasoulakis, Stavros D. Ioannidis
Computing a Karush-Kuhn-Tucker (KKT) point of a quadratic polynomial over the unit hypercube is known to be -complete, when the coefficients of the polynomial are encoded in b…
Improved Last-iterate Convergence Properties for the FLBR-MWU Dynamics
Michail Fasoulakis, Evangelos Markakis, Giorgos Roussakis +1
We revisit a variant of Multiplicative Weights Update (MWU), defined recently by Fasoulakis et al. [AISTATS; 2022], and denoted as Forward Looking Best Response MWU (FLBR-MWU). The…
Delegated Fair Division
Argyrios Deligkas, Michail Fasoulakis, Stavros D. Ioannidis +2
Motivated by recently introduced problems on delegated resource allocation, we study a model of fair division, where a set of indivisible goods is to be allocated to some agents, e…
On Altruism and Spite in Bimatrix Games
Michail Fasoulakis, Leonidas Bakopoulos, Charilaos Akasiadis +1
One common assumption in game theory is that any player optimizes a utility function that takes into account only its own payoff. However, it has long been observed that in real li…
A Descent-based method on the Duality Gap for solving zero-sum games
Michail Fasoulakis, Evangelos Markakis, Giorgos Roussakis +1
We focus on the design of algorithms for finding equilibria in 2-player zero-sum games. Although it is well known that such problems can be solved by a single linear program, there…
Revisit the Arimoto-Blahut algorithm: New Analysis with Approximation
Michail Fasoulakis, Konstantinos Varsos, Apostolos Traganitis
By the seminal paper of Claude Shannon \cite{Shannon48}, the computation of the capacity of a discrete memoryless channel has been considered as one of the most important and funda…
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
Since the seminal PPAD-completeness result for computing a Nash equilibrium even in two-player games, an important line of research has focused on relaxations achievable in polynom…
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
Since the celebrated PPAD-completeness result for Nash equilibria in bimatrix games, a long line of research has focused on polynomial-time algorithms that compute -ap…
Forward Looking Best-Response Multiplicative Weights Update Methods for Bilinear Zero-sum Games
Michail Fasoulakis, Evangelos Markakis, Yannis Pantazis +1
Our work focuses on extra gradient learning algorithms for finding Nash equilibria in bilinear zero-sum games. The proposed method, which can be formally considered as a variant of…
Cumulant GAN
Yannis Pantazis, Dipjyoti Paul, Michail Fasoulakis +2
In this paper, we propose a novel loss function for training Generative Adversarial Networks (GANs) aiming towards deeper theoretical understanding as well as improved stability an…
Training Generative Adversarial Networks with Weights
Yannis Pantazis, Dipjyoti Paul, Michail Fasoulakis +1
The impressive success of Generative Adversarial Networks (GANs) is often overshadowed by the difficulties in their training. Despite the continuous efforts and improvements, there…
Jamming in multiple independent Gaussian channels as a game
Michail Fasoulakis, Apostolos Traganitis, Anthony Ephremides
We study the problem of \emph{jamming} in multiple independent \emph{Gaussian channels} as a zero-sum game. We show that in the unique Nash equilibrium of the game the best-respons…
A New Theoretical Evaluation Framework for Satisfaction Equilibria in Wireless Networks
Michail Fasoulakis, Eirini-Eleni Tsiropoulou, Symeon Papavassiliou
In this paper, a theoretical evaluation framework regarding the \textit{Satisfaction Equilibrium (SE)} in wireless communication networks is introduced and examined. To study these…
Distributed Methods for Computing Approximate Equilibria
Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis +3
We present a new, distributed method to compute approximate Nash equilibria in bimatrix games. In contrast to previous approaches that analyze the two payoff matrices at the same t…
Approximate well-supported Nash equilibria in symmetric bimatrix games
Artur Czumaj, Michail Fasoulakis, Marcin Jurdziński
The -well-supported Nash equilibrium is a strong notion of approximation of a Nash equilibrium, where no player has an incentive greater than to deviate…