![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 23 matches
- 2024
- Damien Berriaud, Ezzat Elokda, Devansh Jalota, Emilio Frazzoli, Marco Pavone, Florian Dörfler:
To Spend or to Gain: Online Learning in Repeated Karma Auctions. CoRR abs/2403.04057 (2024) - Benjamin Heymann, Rémi Chan-Renous-Legoubin, Alexandre Gilotte:
A pragmatic policy learning approach to account for users' fatigue in repeated auctions. CoRR abs/2407.10504 (2024) - 2023
- Qian Wang
, Zongjun Yang, Xiaotie Deng, Yuqing Kong:
Learning to Bid in Repeated First-Price Auctions with Budgets. ICML 2023: 36494-36513 - Qian Wang, Zongjun Yang, Xiaotie Deng, Yuqing Kong:
Learning to Bid in Repeated First-Price Auctions with Budgets. CoRR abs/2304.13477 (2023) - Rigel Galgana, Negin Golrezaei:
Learning in Repeated Multi-Unit Pay-As-Bid Auctions. CoRR abs/2307.15193 (2023) - 2022
- Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, Vianney Perchet:
Learning in Repeated Auctions. Found. Trends Mach. Learn. 15(3): 176-334 (2022) - Rui Ai, Chang Wang, Chenchen Li, Jinshan Zhang, Wenhan Huang, Xiaotie Deng:
No-regret Learning in Repeated First-Price Auctions with Budget Constraints. CoRR abs/2205.14572 (2022) - Yudong Hu, Congying Han, Tiande Guo, Hao Xiao
:
Learning with Opponent Modeling in Repeated Auctions. CoRR abs/2212.02723 (2022) - 2021
- Andrew L. Liu, Zibo Zhao:
Multi-Agent Learning in Repeated Double-side Auctions for Peer-to-peer Energy Trading. HICSS 2021: 1-10 - Gali Noti, Vasilis Syrgkanis:
Bid Prediction in Repeated Auctions with Learning. WWW 2021: 3953-3964 - 2020
- Alexey Drutsa:
Optimal Non-parametric Learning in Repeated Contextual Auctions with Strategic Buyer. ICML 2020: 2668-2677 - Yanjun Han, Zhengyuan Zhou, Tsachy Weissman:
Optimal No-regret Learning in Repeated First-price Auctions. CoRR abs/2003.09795 (2020) - Gali Noti, Vasilis Syrgkanis:
Bid Prediction in Repeated Auctions with Learning. CoRR abs/2007.13193 (2020) - Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, Vianney Perchet:
Learning in repeated auctions. CoRR abs/2011.09365 (2020) - 2019
- Santiago R. Balseiro
, Yonatan Gur
:
Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium. Manag. Sci. 65(9): 3952-3968 (2019) - Orcun Karaca, Pier Giuseppe Sessa, Anna Leidi, Maryam Kamgarpour:
No-Regret Learning from Partially Observed Data in Repeated Auctions. CoRR abs/1912.09905 (2019) - 2017
- M. Sevi Baltaoglu, Lang Tong, Qing Zhao:
Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions. NIPS 2017: 4507-4517 - Santiago R. Balseiro, Yonatan Gur:
Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium. EC 2017: 609 - Sevi Baltaoglu, Lang Tong, Qing Zhao:
Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions. CoRR abs/1703.02567 (2017) - 2016
- Jonathan Weed, Vianney Perchet, Philippe Rigollet:
Online learning in repeated auctions. COLT 2016: 1562-1583 - 2015
- Jonathan Weed, Vianney Perchet, Philippe Rigollet:
Online learning in repeated auctions. CoRR abs/1511.05720 (2015) - 2011
- Zhu Han, Rong Zheng, Harold Vincent Poor
:
Repeated Auctions with Bayesian Nonparametric Learning for Spectrum Access in Cognitive Radio Networks. IEEE Trans. Wirel. Commun. 10(3): 890-900 (2011) - 2009
- Zhu Han, Rong Zheng, H. Vincent Poor:
Repeated Auctions with Learning for Spectrum Access in Cognitive Radio Networks. CoRR abs/0910.2240 (2009)
loading more results
failed to load more results, please try again later
![](https://dblp.org/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.
retrieved on 2024-09-06 12:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint