Argyrios Deligkas

• Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

With John Fearnley, Themistoklis Melissourgos, and Paul Spirakis ICALP-19

• Approximating the Existential Theory of the Reals WINE-18

With John Fearnley, Themistoklis Melissourgos, and Paul Spirakis

• Directed Graph Minors and Serial-Parallel Width MFCS-18

With Reshef Meir

• Traffic Light Scheduling, Value of Time, and Incentives IJCAI-18

With Erez Karpaz, Ron Lavi, and Rann Smorodinsky

• Heterogeneous Facility Location Games AAMAS-18

With Eleftherios Anastasiadis

• Computing Constrained Approximate Equilibria in Polymatrix Games SAGT-17

With John Fearnley and Rahul Savani

• Binary Search in Graphs Revisited MFCS-17

With George Mertzios and Paul Spirakis

• On the Complexity of Weighted Greedy Matchings AAAI-17

With George Mertzios and Paul Spirakis

• Inapproximability Results for Approximate Nash Equilibria WINE-16

With John Fearnley and Rahul Savani

• Distributed Methods for Computing Approximate Equilibria WINE-16

With Artur Czumaj, Michail Fasoulakis, John Fearnley, Marcin Jurdziński, and Rahul Savani

• Lipschitz Continuity and Approximate Equilibria SAGT-16

With John Fearnley and Paul Spirakis

• An Empirical Study on Computing Equilibria in Polymatrix Games AAMAS-16

With John Fearnley, Tobenna Peter Igwe, and Rahul Savani

• Computing approximate Nash Equilibria in Polymatrix Games WINE-14

With John Fearnley, Rahul Savani and Paul Spirakis

• Increasing VCG Revenue by Decreasing the Quality of Items AAAI-14

With Mingyu Guo and Rahul Savani

• Revenue Maximization via Hiding Item Attributes IJCAI-13

With Mingyu Guo