Michail Fasoulakis's research while affiliated with NHS Forth Valley and other places
What is this page?
This page lists the scientific contributions of an author, who either does not have a ResearchGate profile, or has not yet added these contributions to their profile.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
Publications (13)
In this article, we propose a novel loss function for training generative adversarial networks (GANs) aiming toward deeper theoretical understanding as well as improved stability and performance for the underlying optimization problem. The new loss function is based on cumulant generating functions (CGFs) giving rise to Cumulant GAN. Relying on a r...
We propose a novel variant of the \emph{multiplicative weights update method} with forward-looking best-response strategies, that guarantees last-iterate convergence for \emph{zero-sum games} with a unique \emph{Nash equilibrium}. Particularly, we show that the proposed algorithm converges to an $\eta^{1/\rho}$-approximate Nash equilibrium, with $\...
Despite the continuous improvements of Generative Adversarial Networks (GANs), stability and performance challenges still remain. In this work, we propose a novel loss function for GAN training aiming both for deeper theoretical understanding and improved performance of the underlying optimization problem. The new loss function is based on cumulant...
We focus on the problem of computing approximate Nash equilibria in bimatrix games. In particular, we consider the notion of approximate well-supported equilibria, which is one of the standard approaches for approximating equilibria. It is already known that one can compute an ε-well-supported Nash equilibrium in time nO (log n/ε2), for any ε > 0,...
Spectrum scarcity, combined with the tremendous increase of mobile users and their need for personalized services with different Quality of Service (QoS) requirements, fuel the necessity for the design of resource management approaches that ensure operation efficiency, flexibility and scalability. In this paper, we provide a novel theoretical frame...
We study the problem of jamming in multiple independent Gaussian channels as a zero-sum game. We show that in the unique Nash equilibrium of the game the best-response strategy of the transmitter is the waterfilling to the sum of the jamming and the noise power in each channel and the best-response strategy of the jammer is the waterfilling only to...
The impressive success of Generative Adversarial Networks (GANs) is often overshadowed by the difficulties in their training. Despite the continuous efforts and improvements, there are still open issues regarding their convergence properties. In this paper, we propose a simple training variation where suitable weights are defined and assist the tra...
The impressive success of Generative Adversarial Networks (GANs) is often overshadowed by the difficulties in their training. Despite the continuous efforts and improvements, there are still open issues regarding their convergence properties. In this paper, we propose a simple training variation where suitable weights are defined and assist the tra...
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-response strategy of the transmitter is the \emph{waterfilling} to the sum of the jamming and the noise power in each channel and the best-response strategy of the jammer is the...
In this paper, a theoretical evaluation framework regarding the Satisfaction Equilibrium (SE) in wireless communication networks is introduced and examined. To study these equilibria operation points, we coin some new concepts, namely the Valued Satisfaction Equilibrium, the Price of Efficiency and the Max Price of Satisfaction, which can be used f...
In this paper, a theoretical evaluation framework regarding the \textit{Satisfaction Equilibrium (SE)} in wireless communication networks is introduced and examined. To study these equilibria operation points, we coin some new concepts, namely the \textit{Valued Satisfaction Equilibrium}, the \textit{Price of Efficiency} and the \textit{Max Price o...
Citations
... Unmatched image-to-image conversion has successfully achieved recently by using a GAN variant known as cycle-consistent GAN [19,50,55] with an identity-mapping loss [39]. In this work, we follow the CycleGAN concept of unpaired speech-to-speech conversion [16] and introduce a new training process guided by weighted GAN [30] named as WeCycleGAN, to perform the task of multilingual speech mode transformation. The WeCycleGAN is a modified version of CycleGAN that really can learn data distributions over diverse domains without needing a parallel speech dataset. ...
![[object Object]](https://i1.rgstatic.net/ii/profile.image/1139595538366464-1648712157122_Q64/Yannis-Pantazis.jpg)
![[object Object]](https://i1.rgstatic.net/ii/profile.image/481838536892417-1491890667411_Q64/Dipjyoti-Paul.jpg)
... A related problem of satisfying the needs of multiple players is a type of game theory called satisfaction games [22,23]. Here, a minimum utility threshold is defned for each player, and a joint strategy is defned as a satisfaction equilibrium if all players obtain utility above the threshold. ...
![[object Object]](https://i1.rgstatic.net/ii/profile.image/733882156605445-1551982549622_Q64/Eirini-Eleni-Tsiropoulou.jpg)
... Therefore, the unprecedented need of rethinking the resource orchestration process arises in 5G wireless networks to address the QoS demands of the significantly increasing number of users. Towards this direction, a new concept of equilibrium is introduced, Satisfaction Equilibrium, where the users aim to satisfy their minimum QoS prerequisites instead of targeting at QoS maximization [6], [7]. In [8] the definition of the Satisfaction Equilibrium (SE) and the general conditions for examining its existence have been discussed in detail. ...
... The Gaussian interference channel (IC) is a fundamental communication scenario where multiple users share the same frequency and time resources for the transmission of the desired messages. It has been vastly studied over the last decades [24][25][26][27][28][29][30][31] but its capacity is still unknown in the general case [24][25][26]. In some particular cases such as the very strong and very weak interference regimes, the capacity-achieving schemes are known [26]. ...
![[object Object]](https://i1.rgstatic.net/ii/profile.image/507010350358528-1497892095233_Q64/Apostolos-Traganitis-2.jpg)
