default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarie van den Bogaard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Léonard Brice, Jean-François Raskin, Mathieu Sassolas, Guillaume Scerri, Marie van den Bogaard:
Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents. CoRR abs/2405.18958 (2024)- 2023
- [j4]Léonard Brice, Marie van den Bogaard, Jean-François Raskin:
Subgame-perfect Equilibria in Mean-payoff Games (journal version). Log. Methods Comput. Sci. 19(4) (2023) - [c11]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
Rational Verification for Nash and Subgame-Perfect Equilibria in Graph Games. MFCS 2023: 26:1-26:15 - [i12]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
Rational verification and checking for Nash and subgame-perfect equilibria in graph games. CoRR abs/2301.12913 (2023) - 2022
- [c10]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
On the Complexity of SPEs in Parity Games. CSL 2022: 10:1-10:17 - [c9]Laurent Doyen, Marie van den Bogaard:
Bounds for Synchronizing Markov Decision Processes. CSR 2022: 133-151 - [c8]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
The Complexity of SPEs in Mean-Payoff Games. ICALP 2022: 116:1-116:20 - [i11]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
The Complexity of SPEs in Mean-payoff Games. CoRR abs/2202.08499 (2022) - [i10]Léonard Brice, Marie van den Bogaard, Jean-François Raskin:
Subgame-perfect Equilibria in Mean-payoff Games (journal version). CoRR abs/2203.08546 (2022) - [i9]Laurent Doyen, Marie van den Bogaard:
Bounds for Synchronizing Markov Decision Processes. CoRR abs/2204.12814 (2022) - 2021
- [c7]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
Subgame-Perfect Equilibria in Mean-Payoff Games. CONCUR 2021: 8:1-8:17 - [i8]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
Subgame-perfect Equilibria in Mean-payoff Games. CoRR abs/2101.10685 (2021) - [i7]Léonard Brice, Marie van den Bogaard, Jean-François Raskin:
On the Complexity of SPEs in Parity Games. CoRR abs/2107.07458 (2021) - 2020
- [j3]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. Log. Methods Comput. Sci. 16(4) (2020)
2010 – 2019
- 2019
- [c6]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. CONCUR 2019: 13:1-13:16 - [c5]Michaël Cadilhac, Guillermo A. Pérez
, Marie van den Bogaard:
The Impatient May Use Limited Optimism to Minimize Regret. FoSSaCS 2019: 133-149 - [i6]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version). CoRR abs/1905.00784 (2019) - 2018
- [j2]Dietmar Berwanger, Anup Basil Mathew, Marie van den Bogaard:
Hierarchical information and the synthesis of distributed strategies. Acta Informatica 55(8): 669-701 (2018) - [j1]Dietmar Berwanger, Marie van den Bogaard:
Consensus Game Acceptors and Iterated Transductions. Int. J. Found. Comput. Sci. 29(2): 165-186 (2018) - [c4]Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond Admissibility: Dominance Between Chains of Strategies. CSL 2018: 10:1-10:22 - [i5]Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond admissibility: Dominance between chains of strategies. CoRR abs/1805.11608 (2018) - [i4]Michaël Cadilhac, Guillermo A. Pérez, Marie van den Bogaard:
The Impatient May Use Limited Optimism to Minimize Regret. CoRR abs/1811.07146 (2018) - 2016
- [b1]Marie van den Bogaard:
Motifs de flot d'Information dans les jeux à information imparfaite. (Information-flow Patterns in Games with Imperfect Information). University of Paris-Saclay, France, 2016 - 2015
- [c3]Dietmar Berwanger, Anup Basil Mathew, Marie van den Bogaard:
Hierarchical Information Patterns and Distributed Strategy Synthesis. ATVA 2015: 378-393 - [c2]Dietmar Berwanger, Marie van den Bogaard:
Consensus Game Acceptors. DLT 2015: 108-119 - [c1]Dietmar Berwanger, Marie van den Bogaard:
Games with Delays - A Frankenstein Approach. FSTTCS 2015: 307-319 - [i3]Dietmar Berwanger, Marie van den Bogaard:
A Characterisation of Context-Sensitive Languages by Consensus Games. CoRR abs/1501.07131 (2015) - [i2]Dietmar Berwanger, Anup Basil Mathew, Marie van den Bogaard:
Hierarchical Information Patterns and Distributed Strategy Synthesis. CoRR abs/1506.03883 (2015) - [i1]Dietmar Berwanger, Marie van den Bogaard:
Games with Delays. A Frankenstein Approach. CoRR abs/1506.03885 (2015)
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-06-24 20:15 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:
