Paul Harrenstein

Available identifiers

zbMath Open harrenstein.paulMaRDI QIDQ250585

List of research outcomes

Publication	Date of Publication	Type
On Imperfect Recall in Multi-Agent Influence Diagrams	2024-02-28	Paper
Partial order games	2022-03-09	Paper
Behavioural strategies in weighted Boolean games	2021-02-08	Paper
Tournament Solutions	2020-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q5111630	2020-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q4972730	2019-11-26	Paper
\(k\)-majority digraphs and the hardness of voting with a constant number of voters	2019-08-07	Paper
Extending tournament solutions	2018-11-07	Paper
Efficient Computation of Semivalues for Game-Theoretic Network Centrality	2018-11-01	Paper
Minimal extending sets in tournaments	2017-10-04	Paper
From model checking to equilibrium checking: reactive modules for rational verification	2017-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q5357709	2017-09-12	Paper
Reasoning about equilibria in game-like concurrent systems	2016-12-02	Paper
Hard and soft preparation sets in Boolean games	2016-09-07	Paper
A note on the McKelvey uncovered set and Pareto optimality	2016-03-01	Paper
Possible and Necessary Winners of Partial Tournaments	2016-01-07	Paper
Iterated Boolean games	2015-06-01	Paper
Minimal retentive sets in tournaments	2014-12-15	Paper
Strategy-proof contract auctions and the role of ties	2014-06-19	Paper
Pareto optimality in coalition formation	2014-03-13	Paper
Testing substitutability of weak preferences	2014-02-11	Paper
Boolean Games with Epistemic Goals	2013-11-06	Paper
On the rate of convergence of fictitious play	2013-10-21	Paper
On the complexity of iterated weak dominance in constant-sum games	2011-11-23	Paper
Pareto Optimality in Coalition Formation	2011-10-28	Paper
Set-rationalizable choice and self-stability	2011-08-16	Paper
On the Rate of Convergence of Fictitious Play	2010-10-19	Paper
Characterization of dominance relations in finite coalitional games	2010-09-20	Paper
A computational analysis of the tournament equilibrium set	2010-04-21	Paper
On the complexity of iterated weak dominance in constant-sum games	2009-12-01	Paper
Ranking games	2009-08-31	Paper
The Computational Complexity of Choice Sets	2009-08-14	Paper
https://portal.mardi4nfdi.de/entity/Q4460679	2004-03-29	Paper

Research outcomes over time

This page was built for person: Paul Harrenstein