Argyris_Deligkas

CS lecturer at Royal Holloway University of London, interested in Algorithms, Computational Complexity, Game Theory

[Argyris_Deligkas @deligkas]

SAGT2023 at @RoyalHolloway ! Amazing first two days (plus one awesome FaiRACAC workshop on Monday)! One more day to come!

[Rahul Savani @rahul__savani]

2-year postdoc position on our EPSRC project on TFNP, which builds on our STOC 2021 best paper showing that CLS = PPAD ∩ PLS.

START DATE: 1st Jan 2024.
APPLICATION DEADLINE: 3rd Oct 2023.
https://t.co/27E0ZVBSpw

[Argyris_Deligkas @deligkas]

@MichalFeldman9 @InbalTalgam @AcmSIGecom @MD4SG Looking forward to it; it's much needed! How about this one? https://t.co/gzIpMLxocC

[Argyris_Deligkas @deligkas]

The list of SAGT 2023 accepted papers is now available! We look forward to see you at Royal Holloway in the begining of September! https://t.co/Lpt1TDHYZP

[Argyris_Deligkas @deligkas]

Today Tiger-Lily presented her paper at @aamas2023, where she explained why it is (computationally) hard to be a successful influencer! @RH_ResInn

[Argyris_Deligkas @deligkas]

Exciting Postdoc opportunity at Royal Holloway on “Social Mechanisms and Allocations”! https://t.co/5i24LHbMlN

[Argyris_Deligkas @deligkas]

Recall, SAGT'23 paper submission deadline is approaching! (Friday, May 12, AoE)
https://t.co/PzMppomkNj

[Argyris_Deligkas @deligkas]

After several requests the deadline for SAGT 2023 has been extended until May 12th! https://t.co/Lpt1TDHYZP

[Argyris_Deligkas @deligkas]

AAAI 2023 in numbers @RealAAAI

[Argyris_Deligkas @deligkas]

More cool things are coming up at RHUL! https://t.co/t69JYKRXUO

[Rahul Savani @rahul__savani]

Postdoc Openings

I'll soon start a 3-year secondment to the Alan Turing Institute to act as one of the PIs, along with Ted Turocy, for the ATI's new Game Theory pillar. We have two 3-year postdoc openings in GT/MARL/@thegambitproj:

https://t.co/yAbNDW2RE2

Deadline: 29 Jan '23.

[Argyris_Deligkas @deligkas]

@paulwgoldberg gave an awesome overview of the PURE-circuit!

[Argyris_Deligkas @deligkas]

Bottom line: If you try to prove hardness for an equilibrium computation problem (or any other problem in PPAD), check our Pure-Circuit problem. It provides a very friendly framework for proving strong negative results!

[Argyris_Deligkas @deligkas]

In our new paper "Pure-Circuit: Strong Inapproximability for PPAD" https://t.co/0S4ABFJYCJ, with John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos, we have introduced a novel technique for proving *strong* PPAD-hardness results.

[Argyris_Deligkas @deligkas]

Furthermore, in a companion paper "Tight Inapproximability for Graphical Games" https://t.co/0JB32aqfVJ, we have derived even harder results for graphical games; this class seems to be hopelessly intractable!

[Argyris_Deligkas @deligkas]

@IJCAIconf @RoyalHolloway This was in fact part of the Undergraduate Research Opportunities offered by RHUL, which was co-supervised with @eduard_eiben

[Argyris_Deligkas @deligkas]

Super-excited! Tiger-Lily presented her first paper at @IJCAIconf!! What's even better, is that Tiger-Lily is a CS undergrad student at @RoyalHolloway!!

[Argyris_Deligkas @deligkas]

Hybrid workshop Recent Advances on Total Search Problems (Monday, July 4)! Check out for the programme, that includes an awesome line-up of speakers! Online registration, which is free, takes less than 30"
https://t.co/qb8NGlkhVL