Rahul Savani

Theory Comput. Syst., 2019

Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

Unique End of Potential Line.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Evolving indoor navigational strategies using gated recurrent units in NEAT.

[BibT_eX]

[DOI]

James Butterworth

Karl Tuyls

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Negative Update Intervals in Deep Multi-Agent Reinforcement Learning.

[BibT_eX]

[DOI]

Gregory Palmer

Karl Tuyls

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.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Inapproximability results for constrained approximate Nash equilibria.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Space Debris Removal: Learning to Cooperate and the Price of Anarchy.

[BibT_eX]

[DOI]

Frontiers Robotics AI, 2018

End of Potential Line.

[BibT_eX]

[DOI]

CoRR, 2018

Reachability Switching Games.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Beyond Local Nash Equilibria for Adversarial Networks.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence - 30th Benelux Conference, 2018

Market Making via Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Lenient Multi-Agent Deep Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

GANGs: Generative Adversarial Network Games.

[BibT_eX]

[DOI]

CoRR, 2017

Symmetric Decomposition of Asymmetric Games.

[BibT_eX]

[DOI]

CoRR, 2017

CLS: New Problems and Completeness.

[BibT_eX]

[DOI]

CoRR, 2017

Computing Constrained Approximate Equilibria in Polymatrix Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

LiftUpp: Support to Develop Learner Performance.

[BibT_eX]

[DOI]

John Christopher Jones

Proceedings of the Artificial Intelligence in Education - 18th International Conference, 2017

2016

Hedonic Games.

[BibT_eX]

[DOI]

Haris Aziz

Proceedings of the Handbook of Computational Social Choice, 2016

Inapproximability Results for Approximate Nash Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Distributed Methods for Computing Approximate Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

The Complexity of All-switches Strategy Improvement.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Space Debris Removal: A Game Theoretic Analysis.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

An Empirical Study on Computing Equilibria in Polymatrix Games.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Unit Vector Games.

[BibT_eX]

[DOI]

Bernhard von Stengel

CoRR, 2015

Game Theory Explorer: software for the applied game theorist.

[BibT_eX]

[DOI]

Bernhard von Stengel

Comput. Manag. Sci., 2015

An Empirical Study of Finding Approximate Equilibria in Bimatrix Games.

[BibT_eX]

[DOI]

Tobenna Peter Igwe

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

The Complexity of the Simplex Method.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014

Equilibrium Computation (Dagstuhl Seminar 14342).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2014

Computing Approximate Nash Equilibria in Polymatrix Games.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

A data rich money market model - agent-based modelling for financial stability.

[BibT_eX]

[DOI]

Paul Devine

Proceedings of the 4th International Conference On Simulation And Modeling Methodologies, 2014

Finding approximate Nash equilibria of bimatrix games via payoff queries.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Economics and Computation, 2014

Cooperative max games and agent failures.

[BibT_eX]

[DOI]

Yoram Bachrach

Nisarg Shah

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Increasing VCG Revenue by Decreasing the Quality of Items.

[BibT_eX]

[DOI]

Mingyu Guo

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Learning equilibria of games via payoff queries.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

High-Frequency Trading: The Faster, the Better?

[BibT_eX]

[DOI]

IEEE Intell. Syst., 2012

Approximate Well-Supported Nash Equilibria Below Two-Thirds.

[BibT_eX]

[DOI]

Paul W. Goldberg

Christos H. Papadimitriou

Troels Bjerre Sørensen

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

2011

The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions.

[BibT_eX]

[DOI]

Paul W. Goldberg

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

On the Approximation Performance of Fictitious Play in Finite Games.

[BibT_eX]

[DOI]

Paul W. Goldberg

Troels Bjerre Sørensen

Carmine Ventre

Proceedings of the Algorithms - ESA 2011, 2011

Computing stable outcomes in hedonic games with voting-based deviations.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010

Linear Complementarity Algorithms for Infinite Games.

[BibT_eX]

[DOI]

Marcin Jurdzinski

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Computing Stable Outcomes in Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009

Spanning connectivity games

[BibT_eX]

[DOI]

CoRR, 2009

Wiretapping a Hidden Network.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Power Indices in Spanning Connectivity Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

A Simple P-Matrix Linear Complementarity Problem for Discounted Games.

[BibT_eX]

[DOI]

Marcin Jurdzinski

Proceedings of the Logic and Theory of Algorithms, 2008

2004

Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game.

[BibT_eX]

[DOI]