![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Björn Haddenhorst
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c5]Viktor Bengs, Björn Haddenhorst, Eyke Hüllermeier:
Identifying Copeland Winners in Dueling Bandits with Indifferences. AISTATS 2024: 226-234 - 2023
- [b1]Björn Haddenhorst:
Testing coherence and identifying winners in dueling bandits: theory and algorithms. Paderborn University, Germany, 2023 - [c4]Jasmin Brandt, Elias Schede, Björn Haddenhorst
, Viktor Bengs, Eyke Hüllermeier, Kevin Tierney:
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration. AAAI 2023: 12355-12363 - [i3]Viktor Bengs, Björn Haddenhorst, Eyke Hüllermeier:
Identifying Copeland Winners in Dueling Bandits with Indifferences. CoRR abs/2310.00750 (2023) - 2022
- [j3]Karlson Pfannschmidt
, Pritha Gupta
, Björn Haddenhorst
, Eyke Hüllermeier
:
Learning context-dependent choice functions. Int. J. Approx. Reason. 140: 116-155 (2022) - [c3]Jasmin Brandt, Viktor Bengs, Björn Haddenhorst, Eyke Hüllermeier:
Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget. NeurIPS 2022 - [i2]Jasmin Brandt, Björn Haddenhorst, Viktor Bengs, Eyke Hüllermeier:
Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget. CoRR abs/2202.04487 (2022) - [i1]Jasmin Brandt, Elias Schede, Viktor Bengs, Björn Haddenhorst, Eyke Hüllermeier, Kevin Tierney:
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration. CoRR abs/2212.00333 (2022) - 2021
- [j2]Björn Haddenhorst
, Viktor Bengs, Eyke Hüllermeier:
On testing transitivity in online preference learning. Mach. Learn. 110(8): 2063-2084 (2021) - [c2]Björn Haddenhorst, Viktor Bengs, Eyke Hüllermeier:
Identification of the Generalized Condorcet Winner in Multi-dueling Bandits. NeurIPS 2021: 25904-25916 - [c1]Björn Haddenhorst
, Viktor Bengs, Jasmin Brandt, Eyke Hüllermeier:
Testification of Condorcet Winners in dueling bandits. UAI 2021: 1195-1205 - 2020
- [j1]Björn Haddenhorst
, Eyke Hüllermeier, Martin Kolb
:
Generalized transitivity: A systematic comparison of concepts with an application to preferences in the Babington Smith model. Int. J. Approx. Reason. 119: 373-407 (2020)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-05-14 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint