Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Michail Fasoulakis"'
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56c1793a8528079dc49460cfc248c619
https://doi.org/10.1137/1.9781611977554.ch146
https://doi.org/10.1137/1.9781611977554.ch146
Publikováno v:
IEEE transactions on neural networks and learning systems.
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 f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1653f708b81ad074f86f3799c615c620
https://pubmed.ncbi.nlm.nih.gov/35385390
https://pubmed.ncbi.nlm.nih.gov/35385390
Publikováno v:
Proceedings of the 14th International Conference on Agents and Artificial Intelligence.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61d70f7f8c2993e18c79c5d6d549da4d
https://doi.org/10.5220/0010836100003116
https://doi.org/10.5220/0010836100003116
Publikováno v:
Computer Networks. 159:135-146
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 op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fec590b6ffd9c1ca2ab14ab4d865f6e
https://doi.org/10.1016/j.comnet.2019.05.012
https://doi.org/10.1016/j.comnet.2019.05.012
Autor:
Evangelos Markakis, Michail Fasoulakis
Publikováno v:
AAAI
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 kn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8c88fda34df1b4a02e68d37457c51a4
https://doi.org/10.1609/aaai.v33i01.33011926
https://doi.org/10.1609/aaai.v33i01.33011926
Publikováno v:
PRICAI 2021: Trends in Artificial Intelligence ISBN: 9783030891879
PRICAI (1)
PRICAI (1)
A common assumption in game theory is that players have a common and correct (albeit not always complete) knowledge with regards to the abstract formulation of the game. However, in many real-world situations it could be the case that (some of) the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fb6e6abc9627be6d4c5768e92995e68
https://doi.org/10.1007/978-3-030-89188-6_6
https://doi.org/10.1007/978-3-030-89188-6_6
Background. Gynecologic melanomas are extremely rare malignancies, and primary malignant melanoma of the cervix (PMMC) is the rarest among them all, with less than 100 cases reported so far. Although some conditions have been correlated with the path
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2127::a0d492b81705bc45b79771871cb98384
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:3192423
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:3192423
Publikováno v:
2019 27th European Signal Processing Conference (EUSIPCO)
EUSIPCO
EUSIPCO
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::303d94bc5df0fe631c1c2b1ecca7f415
https://zenodo.org/record/4488640
https://zenodo.org/record/4488640
Publikováno v:
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering ISBN: 9783030169886
GAMENETS
GAMENETS
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de59a94e84a2dba460b9f15742914757
https://doi.org/10.1007/978-3-030-16989-3_1
https://doi.org/10.1007/978-3-030-16989-3_1
Autor:
Rahul Savani, John Fearnley, Michail Fasoulakis, Marcin Jurdziński, Artur Czumaj, Argyrios Deligkas
Publikováno v:
Algorithmica: an international journal in computer science
Web and Internet Economics ISBN: 9783662541098
WINE
Lecture Notes in Computer Science
Web and Internet Economics ISBN: 9783662541098
WINE
Lecture Notes in Computer Science
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 time (for example, by solving a single LP that combines the two players
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eedf8830e3658d83829910ddd50f6ac9
http://wrap.warwick.ac.uk/103481/1/WRAP-distributed-methods-computing-approximate-Czumaj-2018.pdf
http://wrap.warwick.ac.uk/103481/1/WRAP-distributed-methods-computing-approximate-Czumaj-2018.pdf