default search action
Paul Harrenstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c37]Wei-Chen Lee, David Hyland, Alessandro Abate, Edith Elkind, Jiarui Gan, Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
k-Prize Weighted Voting Game. AAMAS 2023: 2049-2057 - [c36]James Fox
, Matt MacDermott, Lewis Hammond, Paul Harrenstein, Alessandro Abate, Michael J. Wooldridge:
On Imperfect Recall in Multi-Agent Influence Diagrams. TARK 2023: 201-220 - [i10]Wei-Chen Lee, David Hyland, Alessandro Abate, Edith Elkind, Jiarui Gan, Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
k-Prize Weighted Voting Games. CoRR abs/2302.13888 (2023) - 2022
- [j30]Valeria Zahoransky, Julian Gutierrez, Paul Harrenstein
Partial Order Games. Games 13(1): 2 (2022) - [c35]Paul Harrenstein, Paolo Turrini:
Computing Nash Equilibria for District-based Nominations. AAMAS 2022: 588-596 - 2021
- [j29]Alessandro Abate, Julian Gutierrez, Lewis Hammond, Paul Harrenstein, Marta Kwiatkowska, Muhammad Najib
Rational verification: game-theoretic verification of multi-agent systems. Appl. Intell. 51(9): 6569-6584 (2021) - [j28]Dongge Han, Paul Harrenstein, Steven Nugent, Jonathan Philpott, Michael J. Wooldridge:
Behavioural strategies in weighted Boolean games. Inf. Comput. 276: 104556 (2021) - [j27]Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli
Expressiveness and Nash Equilibrium in Iterated Boolean Games. ACM Trans. Comput. Log. 22(2): 8:1-8:38 (2021) - [c34]Paul Harrenstein, Grzegorz Lisowski, Ramanujan Sridharan, Paolo Turrini:
A Hotelling-Downs Framework for Party Nominees. AAMAS 2021: 593-601 - 2020
- [j26]Paul E. Dunne
Delegating Decisions in Strategic Settings. IEEE Trans. Artif. Intell. 1(1): 19-33 (2020)
2010 – 2019
- 2019
- [j25]Georg Bachmeier, Felix Brandt, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters
k-Majority digraphs and the hardness of voting with a constant number of voters. J. Comput. Syst. Sci. 105: 130-157 (2019) - [j24]Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli
Nash Equilibrium and Bisimulation Invariance. Log. Methods Comput. Sci. 15(3) (2019) - [j23]Haris Aziz
Fractional Hedonic Games. ACM Trans. Economics and Comput. 7(2): 6:1-6:29 (2019) - [i9]Paul Harrenstein, Marie-Louise Lackner, Martin Lackner:
A Mathematical Analysis of an Election System Proposed by Gottlob Frege. CoRR abs/1907.03643 (2019) - 2018
- [j22]Mateusz Krzysztof Tarkowski, Piotr L. Szczepanski, Tomasz P. Michalak, Paul Harrenstein, Michael J. Wooldridge:
Efficient Computation of Semivalues for Game-Theoretic Network Centrality. J. Artif. Intell. Res. 63: 145-189 (2018) - [j21]Felix Brandt, Markus Brill
Extending tournament solutions. Soc. Choice Welf. 51(2): 193-222 (2018) - [c33]Julian Gutierrez, Paul Harrenstein, Thomas Steeples, Michael J. Wooldridge:
Local Equilibria in Logic-Based Multi-Player Games. AAMAS 2018: 399-406 - [i8]Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli, Michael J. Wooldridge:
Nash Equilibrium and Bisimulation Invariance. CoRR abs/1808.09213 (2018) - 2017
- [j20]Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
From model checking to equilibrium checking: Reactive modules for rational verification. Artif. Intell. 248: 123-157 (2017) - [j19]Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
Reasoning about equilibria in game-like concurrent systems. Ann. Pure Appl. Log. 168(2): 373-403 (2017) - [j18]Felix Brandt, Paul Harrenstein, Hans Georg Seedig:
Minimal extending sets in tournaments. Math. Soc. Sci. 87: 55-63 (2017) - [c32]Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli
Nash Equilibrium and Bisimulation Invariance. CONCUR 2017: 17:1-17:16 - [c31]Paul Harrenstein, Paolo Turrini, Michael J. Wooldridge:
Characterising the Manipulability of Boolean Games. IJCAI 2017: 1081-1087 - [i7]Georg Bachmeier, Felix Brandt, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters, Hans Georg Seedig:
k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters. CoRR abs/1704.06304 (2017) - [i6]Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin Olsen, Dominik Peters:
Fractional Hedonic Games. CoRR abs/1705.10116 (2017) - 2016
- [j17]Paul Harrenstein, Paolo Turrini, Michael J. Wooldridge:
Hard and Soft Preparation Sets in Boolean Games. Stud Logica 104(4): 813-847 (2016) - [j16]Felix Brandt, Christian Geist, Paul Harrenstein:
A note on the McKelvey uncovered set and Pareto optimality. Soc. Choice Welf. 46(1): 81-91 (2016) - [c30]Michael J. Wooldridge, Julian Gutierrez, Paul Harrenstein, Enrico Marchioni, Giuseppe Perelli, Alexis Toumi
Rational Verification: From Model Checking to Equilibrium Checking. AAAI 2016: 4184-4191 - [c29]Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli, Michael J. Wooldridge:
Expressiveness and Nash Equilibrium in Iterated Boolean Games. AAMAS 2016: 707-715 - [c28]Haris Aziz
Boolean Hedonic Games. KR 2016: 166-175 - [r1]Felix Brandt, Markus Brill, Paul Harrenstein:
Tournament Solutions. Handbook of Computational Social Choice 2016: 57-84 - 2015
- [j15]Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
Iterated Boolean games. Inf. Comput. 242: 53-79 (2015) - [j14]Haris Aziz
Possible and Necessary Winners of Partial Tournaments. J. Artif. Intell. Res. 54: 493-534 (2015) - [c27]Piotr Lech Szczepanski, Mateusz Krzysztof Tarkowski, Tomasz Pawel Michalak, Paul Harrenstein, Michael J. Wooldridge:
Efficient Computation of Semivalues for Game-Theoretic Network Centrality. AAAI 2015: 461-469 - [c26]Paul Harrenstein, Paolo Turrini, Michael J. Wooldridge:
Electric Boolean Games: Redistribution Schemes for Resource-Bounded Agents. AAMAS 2015: 655-663 - [c25]Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
Expresiveness and Complexity Results for Strategic Reasoning. CONCUR 2015: 268-282 - [i5]Haris Aziz, Paul Harrenstein, Jérôme Lang, Michael J. Wooldridge:
Boolean Hedonic Games. CoRR abs/1509.07062 (2015) - 2014
- [j13]Mathijs Michiel de Weerdt
Strategy-proof contract auctions and the role of ties. Games Econ. Behav. 86: 405-420 (2014) - [j12]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Minimal retentive sets in tournaments. Soc. Choice Welf. 42(3): 551-574 (2014) - [c24]Felix Brandt, Markus Brill, Paul Harrenstein:
Extending Tournament Solutions. AAAI 2014: 580-586 - [c23]Haris Aziz
Fractional hedonic games. AAMAS 2014: 5-12 - [c22]Paul Harrenstein, Paolo Turrini, Michael J. Wooldridge:
Hard and soft equilibria in boolean games. AAMAS 2014: 845-852 - [c21]Felix Brandt, Paul Harrenstein, Hans Georg Seedig:
Minimal extending sets in tournaments. AAMAS 2014: 1539-1540 - [c20]Felix Brandt, Markus Brill, Paul Harrenstein:
Extending Tournament Solutions. ISAIM 2014 - [c19]Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
Reasoning about Equilibria in Game-Like Concurrent Systems. KR 2014 - 2013
- [j11]Paul Harrenstein, David F. Manlove
The Joy of Matching. IEEE Intell. Syst. 28(2): 81-85 (2013) - [j10]Haris Aziz
Pareto optimality in coalition formation. Games Econ. Behav. 82: 562-581 (2013) - [j9]Haris Aziz
Testing substitutability of weak preferences. Math. Soc. Sci. 66(1): 91-94 (2013) - [j8]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
On the Rate of Convergence of Fictitious Play. Theory Comput. Syst. 53(1): 41-52 (2013) - [c18]Felix Brandt, Paul Harrenstein, Keyvan Kardel, Hans Georg Seedig:
It only takes a few: on the hardness of voting with a constant number of agents. AAMAS 2013: 375-382 - [c17]Thomas Ågotnes, Paul Harrenstein, Wiebe van der Hoek, Michael J. Wooldridge:
Verifiable Equilibria in Boolean Games. IJCAI 2013: 689-695 - [c16]Julian Gutierrez, Paul Harrenstein, Michael J. Wooldridge:
Iterated Boolean Games. IJCAI 2013: 932-938 - [c15]Thomas Ågotnes, Paul Harrenstein, Wiebe van der Hoek
Boolean Games with Epistemic Goals. LORI 2013: 1-14 - 2012
- [c14]Haris Aziz
Possible and necessary winners of partial tournaments. AAMAS 2012: 585-592 - [c13]Haris Aziz
Individual-based stability in hedonic games depending on the best or worst players. AAMAS 2012: 1311-1312 - [i4]Haris Aziz, Markus Brill, Paul Harrenstein:
Testing Substitutability of Weak Preferences. CoRR abs/1201.0432 (2012) - 2011
- [j7]Felix Brandt, Paul Harrenstein:
Set-rationalizable choice and self-stability. J. Econ. Theory 146(4): 1721-1731 (2011) - [j6]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games. Theory Comput. Syst. 49(1): 162-181 (2011) - [c12]Haris Aziz
Pareto Optimality in Coalition Formation. SAGT 2011: 93-104 - [i3]Haris Aziz, Paul Harrenstein, Evangelia Pyrga:
Individual-based stability in hedonic games depending on the best or worst players. CoRR abs/1105.1824 (2011) - 2010
- [j5]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair:
A computational analysis of the tournament equilibrium set. Soc. Choice Welf. 34(4): 597-609 (2010) - [c11]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Minimal retentive sets in tournaments. AAMAS 2010: 47-58 - [c10]Haris Aziz
Monotone cooperative games and their threshold versions. AAMAS 2010: 1107-1114 - [c9]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
On the Rate of Convergence of Fictitious Play. SAGT 2010: 102-113
2000 – 2009
- 2009
- [j4]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham:
Ranking games. Artif. Intell. 173(2): 221-239 (2009) - [j3]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
The Computational Complexity of Choice Sets. Math. Log. Q. 55(4): 444-459 (2009) - [j2]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann:
Computing Shapley's saddles. SIGecom Exch. 8(2): 3 (2009) - [c8]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Computational aspects of Shapley's saddles. AAMAS (1) 2009: 209-216 - [c7]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games. SAGT 2009: 287-298 - [c6]Paul Harrenstein, Mathijs de Weerdt
A qualitative vickrey auction. EC 2009: 197-206 - [i2]Felix Brandt, Paul Harrenstein:
Set-Rationalizable Choice and Self-Stability. CoRR abs/0910.3580 (2009) - 2008
- [c5]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair:
A Computational Analysis of the Tournament Equilibrium Set. AAAI 2008: 38-43 - 2007
- [c4]Paul Harrenstein, Felix Brandt, Felix A. Fischer:
Commitment and extortion. AAMAS 2007: 26 - [c3]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham:
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios. IJCAI 2007: 1199-1206 - [c2]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
The computational complexity of choice sets. TARK 2007: 82-91 - [i1]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
Recognizing Members of the Tournament Equilibrium Set is NP-hard. CoRR abs/0711.2961 (2007) - 2003
- [j1]Paul Harrenstein, Wiebe van der Hoek, John-Jules Ch. Meyer, Cees Witteveen:
A Modal Characterization of Nash Equilibrium. Fundam. Informaticae 57(2-4): 281-321 (2003) - 2002
- [c1]Paul Harrenstein, Wiebe van der Hoek, John-Jules Ch. Meyer, Cees Witteveen:
On Modal Logic Interpretations of Games. ECAI 2002: 28-32
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: