2024
Selfishly Prepaying in Financial Credit Networks.
J. Artif. Intell. Res., 2024
Assessing data-driven predictions of band gap and electrical conductivity for transparent conducting materials.
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
CoRR, 2024
Super Unique Tarski is in UEOPL.
CoRR, 2024
The Complexity of Computing KKT Solutions of Quadratic Programs.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
A Strategic Analysis of Prepayments in Financial Credit Networks.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024
Policy Space Response Oracles: A Survey.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024
Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
The Effect of Liquidity on the Spoofability of Financial Markets.
Proceedings of the 5th ACM International Conference on AI in Finance, 2024
Market Making with Learned Beta Policies.
Proceedings of the 5th ACM International Conference on AI in Finance, 2024
Ordinal Potential-based Player Rating.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024
2023
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS.
J. ACM, February, 2023
First Order Methods for Geometric Optimization of Crystal Structures.
CoRR, 2023
Mbt-gym: Reinforcement learning for model-based limit order book trading.
Proceedings of the 4th ACM International Conference on AI in Finance, 2023
Conditional Generators for Limit Order Book Environments: Explainability, Challenges, and Robustness.
Proceedings of the 4th ACM International Conference on AI in Finance, 2023
2022
A Faster Algorithm for Finding Tarski Fixed Points.
ACM Trans. Algorithms, 2022
Model-based gym environments for limit order book trading.
CoRR, 2022
Generative Models over Neural Controllers for Transfer Learning.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022
Consensus Multiplicative Weights Update: Learning to Learn using Projector-based Game Signatures.
Proceedings of the International Conference on Machine Learning, 2022
Market Making with Scaled Beta Policies.
Proceedings of the 3rd ACM International Conference on AI in Finance, 2022
Sample-based Approximation of Nash in Large Many-Player Games via Gradient Descent.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022
2021
Reachability Switching Games.
Log. Methods Comput. Sci., 2021
Analysing factorizations of action-value networks for cooperative multi-agent reinforcement learning.
Auton. Agents Multi Agent Syst., 2021
A Faster Algorithm for Finding Tarski Fixed Points.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
Trading via selective classification.
Proceedings of the ICAIF'21: 2nd ACM International Conference on AI in Finance, Virtual Event, November 3, 2021
The Complexity of Gradient Descent (Invited Talk).
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021
Difference Rewards Policy Gradients.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021
2020
Mapping the geodemographics of digital inequality in Great Britain: An integration of machine learning into small area estimation.
Comput. Environ. Urban Syst., 2020
Unique end of potential line.
J. Comput. Syst. Sci., 2020
A deep learning approach to identify unhealthy advertisements in street view images.
CoRR, 2020
A Natural Actor-Critic Algorithm with Downside Risk Constraints.
CoRR, 2020
One-Clock Priced Timed Games are PSPACE-hard.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020
Robust Market Making via Adversarial Reinforcement Learning.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020
Tree Polymatrix Games Are PPAD-Hard.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
The Automated Inspection of Opaque Liquid Vaccines.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020
2019
Preface to the Special Issue on Algorithmic Game Theory.
Theory Comput. Syst., 2019
Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games.
Math. Oper. Res., 2019
Distributed Methods for Computing Approximate Equilibria.
Algorithmica, 2019
Evolving indoor navigational strategies using gated recurrent units in NEAT.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019
Negative Update Intervals in Deep Multi-Agent Reinforcement Learning.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
The Representational Capacity of Action-Value Networks for Multi-Agent Reinforcement Learning.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
2018
The Complexity of All-switches Strategy Improvement.
Log. Methods Comput. Sci., 2018
Inapproximability results for constrained approximate Nash equilibria.
Inf. Comput., 2018
Space Debris Removal: Learning to Cooperate and the Price of Anarchy.
Frontiers Robotics AI, 2018
Beyond Local Nash Equilibria for Adversarial Networks.
Proceedings of the Artificial Intelligence - 30th Benelux Conference, 2018
Market Making via Reinforcement Learning.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
Lenient Multi-Agent Deep Reinforcement Learning.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
2017
GANGs: Generative Adversarial Network Games.
CoRR, 2017
Symmetric Decomposition of Asymmetric Games.
CoRR, 2017
CLS: New Problems and Completeness.
CoRR, 2017
Computing Approximate Nash Equilibria in Polymatrix Games.
Algorithmica, 2017
Computing Constrained Approximate Equilibria in Polymatrix Games.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017
LiftUpp: Support to Develop Learner Performance.
,
,
,
,
,
,
,
,
,
,
Proceedings of the Artificial Intelligence in Education - 18th International Conference, 2017
2016
Proceedings of the Handbook of Computational Social Choice, 2016
Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries.
ACM Trans. Economics and Comput., 2016
Space Debris Removal: A Game Theoretic Analysis.
Games, 2016
Approximate Well-supported Nash Equilibria Below Two-thirds.
Algorithmica, 2016
Inapproximability Results for Approximate Nash Equilibria.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016
An Empirical Study on Computing Equilibria in Polymatrix Games.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
2015
Learning equilibria of games via payoff queries.
J. Mach. Learn. Res., 2015
Game Theory Explorer: software for the applied game theorist.
Comput. Manag. Sci., 2015
An Empirical Study of Finding Approximate Equilibria in Bimatrix Games.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015
The Complexity of the Simplex Method.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
2014
Equilibrium Computation (Dagstuhl Seminar 14342).
Dagstuhl Reports, 2014
A data rich money market model - agent-based modelling for financial stability.
Proceedings of the 4th International Conference On Simulation And Modeling Methodologies, 2014
Cooperative max games and agent failures.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014
Increasing VCG Revenue by Decreasing the Quality of Items.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
2013
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions.
ACM Trans. Economics and Comput., 2013
On the approximation performance of fictitious play in finite games.
Int. J. Game Theory, 2013
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013
2012
High-Frequency Trading: The Faster, the Better?
IEEE Intell. Syst., 2012
2011
Computing stable outcomes in hedonic games with voting-based deviations.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011
2010
Linear Complementarity Algorithms for Infinite Games.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010
Computing Stable Outcomes in Hedonic Games.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010
2009
Spanning connectivity games
CoRR, 2009
Wiretapping a Hidden Network.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009
Power Indices in Spanning Connectivity Games.
Proceedings of the Algorithmic Aspects in Information and Management, 2009
2008
A Simple P-Matrix Linear Complementarity Problem for Discounted Games.
Proceedings of the Logic and Theory of Algorithms, 2008
2004
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004