Paul Harrenstein

Proceedings of the Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, 2023

k-Prize Weighted Voting Games.

[BibT_eX]

[DOI]

CoRR, 2023

k-Prize Weighted Voting Game.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Partial Order Games.

[BibT_eX]

[DOI]

Valeria Zahoransky

Games, 2022

Computing Nash Equilibria for District-based Nominations.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Behavioural strategies in weighted Boolean games.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Rational verification: game-theoretic verification of multi-agent systems.

[BibT_eX]

[DOI]

Appl. Intell., 2021

A Hotelling-Downs Framework for Party Nominees.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Delegating Decisions in Strategic Settings.

[BibT_eX]

[DOI]

Paul E. Dunne

Sarit Kraus

IEEE Trans. Artif. Intell., 2020

2019

Fractional Hedonic Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2019

<i>k</i>-Majority digraphs and the hardness of voting with a constant number of voters.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

A Mathematical Analysis of an Election System Proposed by Gottlob Frege.

[BibT_eX]

[DOI]

Marie-Louise Lackner

Martin Lackner

CoRR, 2019

2018

Local Equilibria in Logic-Based Multi-Player Games.

[BibT_eX]

[DOI]

Thomas Steeples

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

2017

k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters.

[BibT_eX]

[DOI]

CoRR, 2017

From model checking to equilibrium checking: Reactive modules for rational verification.

[BibT_eX]

[DOI]

Artif. Intell., 2017

Characterising the Manipulability of Boolean Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Nash Equilibrium and Bisimulation Invariance.

[BibT_eX]

[DOI]

Giuseppe Perelli

Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016

Tournament Solutions.

[BibT_eX]

[DOI]

Markus Brill

Proceedings of the Handbook of Computational Social Choice, 2016

A note on the McKelvey uncovered set and Pareto optimality.

[BibT_eX]

[DOI]

Christian Geist

Soc. Choice Welf., 2016

Hard and Soft Preparation Sets in Boolean Games.

[BibT_eX]

[DOI]

Stud Logica, 2016

Boolean Hedonic Games.

[BibT_eX]

[DOI]

Jérôme Lang

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Expressiveness and Nash Equilibrium in Iterated Boolean Games.

[BibT_eX]

[DOI]

Giuseppe Perelli

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

Rational Verification: From Model Checking to Equilibrium Checking.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Expresiveness and Complexity Results for Strategic Reasoning.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Concurrency Theory, 2015

Electric Boolean Games: Redistribution Schemes for Resource-Bounded Agents.

[BibT_eX]

[DOI]

Mateusz Krzysztof Tarkowski

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Efficient Computation of Semivalues for Game-Theoretic Network Centrality.

[BibT_eX]

[DOI]

Piotr Lech Szczepanski

Tomasz Pawel Michalak

Mathijs Michiel de Weerdt

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Strategy-proof contract auctions and the role of ties.

[BibT_eX]

[DOI]

Vincent Conitzer

Games Econ. Behav., 2014

Reasoning about Equilibria in Game-Like Concurrent Systems.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Hard and soft equilibria in boolean games.

[BibT_eX]

[DOI]

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

Minimal extending sets in tournaments.

[BibT_eX]

[DOI]

Hans Georg Seedig

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

Fractional hedonic games.

[BibT_eX]

[DOI]

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

Extending Tournament Solutions.

[BibT_eX]

[DOI]

Markus Brill

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

2013

Testing substitutability of weak preferences.

[BibT_eX]

[DOI]

Markus Brill

Math. Soc. Sci., 2013

The Joy of Matching.

[BibT_eX]

[DOI]

David F. Manlove

IEEE Intell. Syst., 2013

Boolean Games with Epistemic Goals.

[BibT_eX]

[DOI]

Thomas Ågotnes

Wiebe van der Hoek

Proceedings of the Logic, Rationality, and Interaction - 4th International Workshop, 2013

Iterated Boolean Games.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Verifiable Equilibria in Boolean Games.

[BibT_eX]

[DOI]

Thomas Ågotnes

Wiebe van der Hoek

Proceedings of the IJCAI 2013, 2013

It only takes a few: on the hardness of voting with a constant number of agents.

[BibT_eX]

[DOI]

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

2012

Individual-based stability in hedonic games depending on the best or worst players.

[BibT_eX]

[DOI]

Evangelia Pyrga

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Possible and necessary winners of partial tournaments.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

Set-rationalizable choice and self-stability.

[BibT_eX]

[DOI]

J. Econ. Theory, 2011

Pareto Optimality in Coalition Formation.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

On the Rate of Convergence of Fictitious Play.

[BibT_eX]

[DOI]

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

Minimal retentive sets in tournaments.

[BibT_eX]

[DOI]

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

Monotone cooperative games and their threshold versions.

[BibT_eX]

[DOI]

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

2009

Computing Shapley's saddles.

[BibT_eX]

[DOI]

SIGecom Exch., 2009

Ranking games.

[BibT_eX]

[DOI]

Artif. Intell., 2009

A qualitative vickrey auction.

[BibT_eX]

[DOI]

Mathijs de Weerdt

Vincent Conitzer

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

On the Complexity of Iterated Weak Dominance in Constant-Sum Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Computational aspects of Shapley's saddles.

[BibT_eX]

[DOI]

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

2008

A Computational Analysis of the Tournament Equilibrium Set.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Recognizing Members of the Tournament Equilibrium Set is NP-hard

[BibT_eX]

[DOI]

CoRR, 2007

The computational complexity of choice sets.

[BibT_eX]

[DOI]

Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), 2007

A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

Commitment and extortion.

[BibT_eX]

[DOI]