Paul Harrenstein

According to our database1, Paul Harrenstein authored at least 48 papers between 2002 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Fractional Hedonic Games.
ACM Trans. Economics and Comput., 2019

Nash Equilibrium and Bisimulation Invariance.
Log. Methods Comput. Sci., 2019

<i>k</i>-Majority digraphs and the hardness of voting with a constant number of voters.
J. Comput. Syst. Sci., 2019

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

2018
Extending tournament solutions.
Soc. Choice Welf., 2018

Efficient Computation of Semivalues for Game-Theoretic Network Centrality.
J. Artif. Intell. Res., 2018

Local Equilibria in Logic-Based Multi-Player Games.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Minimal extending sets in tournaments.
Math. Soc. Sci., 2017

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

Reasoning about equilibria in game-like concurrent systems.
Ann. Pure Appl. Log., 2017

From model checking to equilibrium checking: Reactive modules for rational verification.
Artif. Intell., 2017

Characterising the Manipulability of Boolean Games.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Tournament Solutions.
Proceedings of the Handbook of Computational Social Choice, 2016

A note on the McKelvey uncovered set and Pareto optimality.
Soc. Choice Welf., 2016

Hard and Soft Preparation Sets in Boolean Games.
Studia Logica, 2016

Boolean Hedonic Games.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Expressiveness and Nash Equilibrium in Iterated Boolean Games.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Rational Verification: From Model Checking to Equilibrium Checking.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Possible and Necessary Winners of Partial Tournaments.
J. Artif. Intell. Res., 2015

Iterated Boolean games.
Inf. Comput., 2015

Expresiveness and Complexity Results for Strategic Reasoning.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Electric Boolean Games: Redistribution Schemes for Resource-Bounded Agents.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Minimal retentive sets in tournaments.
Soc. Choice Welf., 2014

Strategy-proof contract auctions and the role of ties.
Games Econ. Behav., 2014

Hard and soft equilibria in boolean games.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Fractional hedonic games.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
On the Rate of Convergence of Fictitious Play.
Theory Comput. Syst., 2013

Testing substitutability of weak preferences.
Math. Soc. Sci., 2013

Pareto optimality in coalition formation.
Games Econ. Behav., 2013

The Joy of Matching.
IEEE Intell. Syst., 2013

Boolean Games with Epistemic Goals.
Proceedings of the Logic, Rationality, and Interaction - 4th International Workshop, 2013

Verifiable Equilibria in Boolean Games.
Proceedings of the IJCAI 2013, 2013

It only takes a few: on the hardness of voting with a constant number of agents.
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.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
On the Complexity of Iterated Weak Dominance in Constant-Sum Games.
Theory Comput. Syst., 2011

Set-rationalizable choice and self-stability.
J. Econ. Theory, 2011

2010
A computational analysis of the tournament equilibrium set.
Soc. Choice Welf., 2010

Monotone cooperative games and their threshold versions.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009
Computing Shapley's saddles.
SIGecom Exch., 2009

The Computational Complexity of Choice Sets.
Math. Log. Q., 2009

Ranking games.
Artif. Intell., 2009

A qualitative vickrey auction.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Computational aspects of Shapley's saddles.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2007
Recognizing Members of the Tournament Equilibrium Set is NP-hard
CoRR, 2007

A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios.
Proceedings of the IJCAI 2007, 2007

Commitment and extortion.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

2003
A Modal Characterization of Nash Equilibrium.
Fundam. Inform., 2003

2002
On Modal Logic Interpretations of Games.
Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 2002


  Loading...