Home
Research
CV (on LinkedIn)
DBLP
Google scholar

 

 

 

 

 

My new webpage was moved to Royal Holloway, University of London, UK.

Hi, thanks a lot for your interest in my work. My name is Fasoulakis Michail (Michalis) and I come from Crete. I am an (Applied) Mathematician and (theoretical) Computer Scientist with a background and interest in (Computational) Economics/Game theory/Operations Research and Computer Engineering.

 

My research interests lie in basic and fundamental topics (in abstract structures) for Algorithms, Game theory/Decision theory, Optimization, Mathematics of Information (Information theory), and their (theoretical) applications, especially, in AI/ML, Communications and Signal Processing, Economics and Operations Research.

My main goal is to try to contribute in research introducing new mathematical/theory concepts, or solving analytically/algorithmically abstract problems in these research areas that can be potentially applied in real applications. Furthermore, I am interested in solving problems in specific applications of these areas.

 

More specifically, with my coauthors, I have intensively worked in issues of game theory and their algorithmic view, like the computation of (approximate) Nash equilibria. This line of work had as a result the following selected contributions:

    "In this publication we give a polynomial-time algorithm for computing (1/3+δ)-Nash equilibria, giving the best bound for approximate Nash equilibria at the moment of publication, an improvement for a fundamental problem in algorithmic game theory open for 15 years."

    "In this publication we give a polynomial-time algorithm for computing (1/2+δ)-well-supported Nash equilibria, giving the best bound for approximate well-supported Nash equilibria at the moment of publication, an improvement for a fundamental problem in algorithmic game theory open for 7 years."

  • M. Fasoulakis, E. Markakis, Y. Pantazis, and C. Varsos. "Forward Looking Best-Response Multiplicative Weights Updated Methods for bilinear zero-sum games". AISTATS 2022.

    "In this publication we give a learning algorithm for last iterate convergence in zero-sum bimatrix games (a fundamental class of bimatrix games in game theory)."

 

My academic background is a mix of (theoretical) Computer Science, (Applied) Mathematics, Computer Engineering and (Computational) Microeconomics/Operations Research, having almost 20 years of Education/Research experience.

Particularly, I hold a Ph.D. in (Theoretical) Computer Science (Specifically in Computational Economics/Game Theory) from the department of Computer Science of the University of Warwick, UK, where during my Ph.D. studies I was a member of the Centre for Discrete Mathematics and its Applications (DIMAP).

After my Ph.D. studies I had postdoc/research fellow positions in various academic places such as Athens University of Economics and Business (AUEB), Center for Mathematics and Computer Science in Netherlands - Centrum Wiskunde & Informatica/CWI (as an ERCIM fellow), FORTH (as a Stavros Niarchos Foundation (SNF)-FORTH fellow for a period), School of Electrical and Computer Engineering of the National Technical University of Athens (NTUA), University of Crete.

Furthermore, I hold a M.Sc. in Computation & Game Theory (Computational Economics) from the CS department of the University of Liverpool, UK, and a B.Sc. in CS (from the CS department), a second B.Sc. in Mathematics (from the Mathematics and Applied Mathematics department) and a M.Sc. in Communications & Signal Processing (Computer Engineering) (from the CS department), all of these three degrees from the University of Crete. During my under/post graduate studies in Crete I was a member of the Telecommunications and Networks Laboratory of the ICS-FORTH (Institute of CS, Foundation for Research & Technology-Hellas).

 

 

Fasoulakis Michail Φασουλάκης Μιχαήλ


Contact info:

x@ics.forth.gr, {where x = mfasoul}.

Last update of the webpage: 04/04/2025.