<html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body>
<p>-------- Forwarded Message --------</p>
<div class="moz-forward-container">
<table class="moz-email-headers-table" cellspacing="0" cellpadding="0" border="0">
<tbody>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Subject:
</th>
<td>[DMANET] Three-year Postdoc Position in Algorithms and
Complexity</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Sat, 7 May 2022 15:43:57 +0100</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Rahul Savani <a class="moz-txt-link-rfc2396E" href="mailto:rahul.savani@liverpool.ac.uk"><rahul.savani@liverpool.ac.uk></a></td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">To: </th>
<td><a class="moz-txt-link-abbreviated" href="mailto:dmanet@zpr.uni-koeln.de">dmanet@zpr.uni-koeln.de</a></td>
</tr>
</tbody>
</table>
<br>
<br>
APPLICATION DEADLINE: 16th May 2022<br>
<br>
We are seeking candidates for a three-year postdoctoral research
position<br>
funded by the EPSRC project "New Techniques for Resolving Boundary
Problems<br>
in Total Search"<br>
<br>
The project will be led by John Fearnley
(<a class="moz-txt-link-freetext" href="https://cgi.csc.liv.ac.uk/~john/">https://cgi.csc.liv.ac.uk/~john/</a>>and Rahul Savani
(<a class="moz-txt-link-freetext" href="http://www.csc.liv.ac.uk/~rahul">http://www.csc.liv.ac.uk/~rahul</a> and will run for three<br>
years starting from the 1st of September 2022.<br>
<br>
The project will explore new techniques for showing hardness in
TFNP,<br>
following on from the STOC 2021 best paper “The complexity of
gradient<br>
descent: CLS = PPAD ∩ PLS”. The project will particularly focus on
the<br>
complexity class CLS, which contains problems from a wide variety
of<br>
disciplines, including:<br>
* Algorithmic Game Theory (eg. Network congestion games, Network<br>
coordination games, Shapley stochastic games)<br>
* Formal Verification (eg. Tarski fixed points, Contraction map
fixed<br>
points, Unique sink orientations, Simple-stochastic games)<br>
* Optimization and Machine Learning (eg. finding KKT points of<br>
polynomials, gradient descent in a neural network)<br>
<br>
An ideal candidate will have a strong research background in at
least one<br>
of the three areas listed above. That candidate will also have, or
be close<br>
to completing, a PhD in Computer Science or a related area.<br>
<br>
Informal enquiries are welcome, and should be directed to<br>
<a class="moz-txt-link-abbreviated" href="mailto:john.fearnley@liverpool.ac.uk">john.fearnley@liverpool.ac.uk</a>.<br>
<br>
The application form can be found here:<br>
<a class="moz-txt-link-freetext" href="https://my.corehr.com/pls/ulivrecruit/erq_jobspec_version_4.display_form?p_company=1&p_internal_external=E&p_display_in_irish=N&p_process_type=&p_applicant_no=&p_form_profile_detail=&p_display_apply_ind=Y&p_refresh_search=Y&p_recruitment_id=040746">https://my.corehr.com/pls/ulivrecruit/erq_jobspec_version_4.display_form?p_company=1&p_internal_external=E&p_display_in_irish=N&p_process_type=&p_applicant_no=&p_form_profile_detail=&p_display_apply_ind=Y&p_refresh_search=Y&p_recruitment_id=040746</a>><br>
APPLICATION DEADLINE: 16th May 2022<br>
<br>
</div>
</body>
</html>