default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteen Vester
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j2]Patricia Bouyer, Nicolas Markey
, Steen Vester:
Nash equilibria in symmetric graph games with partial observation. Inf. Comput. 254: 238-258 (2017)- 2016
- [b1]Steen Vester:
Game-based verification and synthesis. Technical University of Denmark, 2016 - [c10]Holger Hermanns, Jan Krcál, Steen Vester:
Distributed Synthesis in Continuous Time. FoSSaCS 2016: 353-369 - [c9]Patrick Kasting, Michael R. Hansen, Steen Vester:
Synthesis of Railway-Signaling Plans using Reachability Games. IFL 2016: 9:1-9:13 - [c8]Steen Vester:
Winning Cores in Parity Games. LICS 2016: 662-671 - [i6]Holger Hermanns, Jan Krcál, Steen Vester:
Distributed Synthesis in Continuous Time. CoRR abs/1601.01587 (2016) - [i5]Steen Vester:
Winning Cores in Parity Games. CoRR abs/1602.01963 (2016) - 2015
- [c7]Steen Vester:
On the Complexity of Model-Checking Branching and Alternating-Time Temporal Logics in One-Counter Systems. ATVA 2015: 361-377 - 2014
- [c6]Valentin Goranko, Steen Vester:
Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics. Advances in Modal Logic 2014: 234-253 - [c5]Nicolas Markey, Steen Vester:
Symmetry Reduction in Infinite Games with Finite Branching. ATVA 2014: 281-296 - [c4]Patricia Bouyer, Nicolas Markey, Steen Vester:
Nash Equilibria in Symmetric Games with Partial Observation. SR 2014: 49-55 - [i4]Steen Vester:
Model-checking Quantitative Alternating-time Temporal Logic on One-counter Game Models. CoRR abs/1409.5681 (2014) - 2013
- [c3]Steen Vester:
Alternating-time temporal logic with finite-memory strategies. GandALF 2013: 194-207 - 2012
- [c2]Jørgen Villadsen, Andreas Schmidt Jensen, Mikko Berggren Ettienne, Steen Vester, Kenneth Balsiger Andersen, Andreas Frøsig:
Reimplementing a Multi-Agent System in Python. ProMAS 2012: 205-216 - [i3]Jørgen Villadsen, Andreas Schmidt Jensen, Mikko Berggren Ettienne, Steen Vester, Kenneth Balsiger Andersen, Andreas Frøsig:
Multi-Agent Programming Contest 2012 - The Python-DTU Team. CoRR abs/1210.0437 (2012) - 2011
- [j1]Steen Vester, Niklas Skamriis Boss, Andreas Schmidt Jensen, Jørgen Villadsen:
Improving multi-agent systems using Jason. Ann. Math. Artif. Intell. 61(4): 297-307 (2011) - [c1]Mikko Berggren Ettienne, Steen Vester, Jørgen Villadsen:
Implementing a Multi-Agent System in Python with an Auction-Based Agreement Approach. ProMAS 2011: 185-196 - [i2]Jørgen Villadsen, Mikko Berggren Ettienne, Steen Vester:
Multi-Agent Programming Contest 2011 - The Python-DTU Team. CoRR abs/1110.0105 (2011) - 2010
- [i1]Jørgen Villadsen, Niklas Skamriis Boss, Andreas Schmidt Jensen, Steen Vester:
Multi-Agent Programming Contest 2010 - The Jason-DTU Team. CoRR abs/1010.0145 (2010)
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-04-25 05:50 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:
