The project will be focused around three general classes of games (Bimatrix Games, Polymatrix Games, and Bayesian Games) and the goal will be to design efficient polynomial-time algorithms for approximate equilibria, or provide appropriate inapproximability lower bounds, e.g., PPAD-hardness.
More details are available at
https://jobs.royalholloway.ac.uk/vacancy.aspx?ref=1123-478
Informal enquiries are welcome:
argyrios.deligkas@rhul.ac.uk
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************