default search action
Nicholas Bishop
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Nicholas Bishop, Hamdi Kavak:
Incorporating Trauma Propagation And Transmission In Agent Based Models: A Preliminary Framework. ANNSIM 2024: 1-13 - [c7]Joel Dyer, Arnau Quera-Bofarull, Nicholas Bishop, J. Doyne Farmer, Anisoara Calinescu, Michael J. Wooldridge:
Population Synthesis as Scenario Generation for Simulation-based Planning under Uncertainty. AAMAS 2024: 490-498 - [c6]Hao Zhou, Yongzhao Wang, Konstantinos Varsos, Nicholas Bishop, Rahul Savani, Anisoara Calinescu, Michael J. Wooldridge:
A Strategic Analysis of Prepayments in Financial Credit Networks. IJCAI 2024: 3040-3048 - [i6]Fabio Massimo Zennaro, Nicholas Bishop, Joel Dyer, Yorgos Felekis, Anisoara Calinescu, Michael J. Wooldridge, Theodoros Damoulas:
Causally Abstracted Multi-armed Bandits. CoRR abs/2404.17493 (2024) - [i5]Imran Mahmood, Nicholas Bishop, Anisoara Calinescu, Michael J. Wooldridge, Ioannis Zachos:
A multi-objective combinatorial optimisation framework for large scale hierarchical population synthesis. CoRR abs/2407.03180 (2024) - 2023
- [j1]David M. Bossens
, Nicholas Bishop:
Explicit Explore, Exploit, or Escape (E4): near-optimal safety-constrained reinforcement learning in polynomial time. Mach. Learn. 112(3): 817-858 (2023) - [c5]Nicholas Bishop, Hamdi Kavak:
The Effect of Empathy on Happiness in Social Networks: An Agent-Based Simulation Study. ANNSIM 2023: 318-331 - [c4]Shivakumar Mahesh, Nicholas Bishop, Le Cong Dinh, Long Tran-Thanh:
Playing Repeated Coopetitive Polymatrix Games with Small Manipulation Cost. GameSec 2023: 257-276 - [i4]Joel Dyer
Interventionally Consistent Surrogates for Agent-based Simulators. CoRR abs/2312.11158 (2023) - 2022
- [c3]Nicholas Bishop, Hau Chan, Debmalya Mandal, Long Tran-Thanh:
Sequential Blocked Matching. AAAI 2022: 4834-4842 - [c2]Nicholas Bishop:
Manipulation of Machine Learning Algoirhtms. AAMAS 2022: 1833-1835 - 2021
- [c1]Nicholas Bishop, Le Cong Dinh, Long Tran-Thanh:
How to Guide a Non-Cooperative Learner to Cooperate: Exploiting No-Regret Algorithms in System Design. AAMAS 2021: 1464-1466 - [i3]Nicholas Bishop, Hau Chan, Debmalya Mandal, Long Tran-Thanh:
Sequential Blocked Matching. CoRR abs/2108.00073 (2021) - [i2]Shivakumar Mahesh, Nicholas Bishop, Le Cong Dinh, Long Tran-Thanh:
Playing Repeated Coopetitive Polymatrix Games with Small Manipulation Cost. CoRR abs/2110.13532 (2021) - [i1]David M. Bossens, Nicholas Bishop:
Explicit Explore, Exploit, or Escape (E4): near-optimal safety-constrained reinforcement learning in polynomial time. CoRR abs/2111.07395 (2021)
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-11-19 20:47 CET 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: