default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichail Fasoulakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Michail Fasoulakis, Konstantinos Varsos, Apostolos Traganitis:
Revisit the Arimoto-Blahut algorithm: New Analysis with Approximation. CoRR abs/2407.06013 (2024)- 2023
- [j5]Argyrios Deligkas
, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. SIAM J. Comput. 52(5): 1083-1096 (2023) - [j4]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. ACM Trans. Algorithms 19(4): 31:1-31:17 (2023) - [j3]Yannis Pantazis, Dipjyoti Paul, Michail Fasoulakis, Yannis Stylianou, Markos A. Katsoulakis:
Cumulant GAN. IEEE Trans. Neural Networks Learn. Syst. 34(11): 9439-9450 (2023) - [c15]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. SODA 2023: 3777-3787 - 2022
- [c14]Michail Fasoulakis, Evangelos Markakis, Yannis Pantazis, Constantinos Varsos:
Forward Looking Best-Response Multiplicative Weights Update Methods for Bilinear Zero-sum Games. AISTATS 2022: 11096-11117 - [c13]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. ESA 2022: 41:1-41:14 - [c12]Constantinos Varsos, Michail Fasoulakis, Giorgos Flouris, Marina Bitsaki:
Coordination Mechanisms with Misinformation. ICAART (1) 2022: 237-244 - [i9]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. CoRR abs/2204.11525 (2022) - [i8]Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. CoRR abs/2207.07007 (2022) - 2021
- [c11]Constantinos Varsos, Giorgos Flouris, Marina Bitsaki, Michail Fasoulakis:
A Study of Misinformation Games. PRICAI (1) 2021: 76-87 - [i7]Michail Fasoulakis, Evangelos Markakis, Yannis Pantazis, Constantinos Varsos:
Forward Looking Best-Response Multiplicative Weights Update Methods. CoRR abs/2106.03579 (2021) - 2020
- [i6]Yannis Pantazis, Dipjyoti Paul, Michail Fasoulakis, Yannis Stylianou, Markos A. Katsoulakis:
Cumulant GAN. CoRR abs/2006.06625 (2020)
2010 – 2019
- 2019
- [j2]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. Algorithmica 81(3): 1205-1231 (2019) - [j1]Michail Fasoulakis, Eirini-Eleni Tsiropoulou, Symeon Papavassiliou:
Satisfy instead of maximize: Improving operation efficiency in wireless communication networks. Comput. Networks 159: 135-146 (2019) - [c10]Michail Fasoulakis, Evangelos Markakis:
An Improved Quasi-Polynomial Algorithm for Approximate Well-Supported Nash Equilibria. AAAI 2019: 1926-1932 - [c9]Yannis Pantazis, Dipjyoti Paul, Michail Fasoulakis, Yannis Stylianou:
Training Generative Adversarial Networks With Weights. EUSIPCO 2019: 1-5 - [c8]Michail Fasoulakis, Apostolos Traganitis, Anthony Ephremides:
Jamming in Multiple Independent Gaussian Channels as a Game. GAMENETS 2019: 3-8 - 2018
- [i5]Michail Fasoulakis, Eirini-Eleni Tsiropoulou, Symeon Papavassiliou:
A New Theoretical Evaluation Framework for Satisfaction Equilibria in Wireless Networks. CoRR abs/1806.01905 (2018) - [i4]Michail Fasoulakis, Apostolos Traganitis, Anthony Ephremides:
Jamming in multiple independent Gaussian channels as a game. CoRR abs/1807.09749 (2018) - [i3]Yannis Pantazis, Dipjyoti Paul, Michail Fasoulakis, Yannis Stylianou:
Training Generative Adversarial Networks with Weights. CoRR abs/1811.02598 (2018) - 2017
- [c7]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Multi-player Approximate Nash Equilibria. AAMAS 2017: 1511-1513 - [c6]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Zero-Sum Game Techniques for Approximate Nash Equilibria. AAMAS 2017: 1514-1516 - [c5]Michail Fasoulakis, Apostolos Traganitis, Anthony Ephremides:
The Gaussian interference channel revisited as a non-cooperative game with transmission cost. WiOpt 2017: 1-7 - 2016
- [c4]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract). AAMAS 2016: 1409-1410 - [c3]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. WINE 2016: 15-28 - 2015
- [c2]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate Nash Equilibria with Near Optimal Social Welfare. IJCAI 2015: 504-510 - [i2]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. CoRR abs/1512.03315 (2015) - 2014
- [c1]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games. SAGT 2014: 244-254 - [i1]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate well-supported Nash equilibria in symmetric bimatrix games. CoRR abs/1407.3004 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
