Demo Data from SIGIR 2026 / reviewers in the wild / expert
Arsenii Vanunts
dblp:220/3335
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% | |
| Artificial intelligence
1 paper |
Learning theory · 50% Reinforcement learning · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › auction theory
posted-price auctions |
0.4 | 1 | 2019 | Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer · NeurIPS 2019 |
Algorithmic game theory and mechanism design
revenue maximization |
0.4 | 1 | 2019 | Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer · NeurIPS 2019 |
Machine learning › Learning theory
online learning |
0.1 | 1 | 2019 | Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer · NeurIPS 2019 |
Machine learning › Reinforcement learning
regret minimization |
0.1 | 1 | 2019 | Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer · NeurIPS 2019 |
Methods — techniques the papers use, named apart from their topics
myerson pricing · 0.8multidimensional optimization · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the BuyerabstractWe study revenue optimization pricing algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation. When the participants non-equally discount their cumulative utilities, we show that the optimal constant pricing (which offers the Myerson price) is no longer optimal. In the case of more patient seller, we propose a novel multidimensional optimization functional --- a generalization of the one used to determine Myerson's price. This functional allows to find the optimal algorithm and to boost revenue of the optimal static pricing by an efficient low-dimensional approximation. Numerical experiments are provided to support our results. Arsenii Vanunts, Alexey Drutsa |
NeurIPS | 1 |