Pages that link to "Item:Q2978838"
From MaRDI portal
The following pages link to Regret Minimization for Reserve Prices in Second-Price Auctions (Q2978838):
Displaying 16 items.
- Batched bandit problems (Q282463) (← links)
- Online learning for min-max discrete problems (Q2166779) (← links)
- Optimal pricing for MHR distributions (Q2190389) (← links)
- Learning and pricing models for repeated generalized second-price auction in search advertising (Q2282562) (← links)
- Maximizing revenue for publishers using header bidding and ad exchange auctions (Q2661631) (← links)
- Diffusive limit approximation of pure-jump optimal stochastic control problems (Q2679562) (← links)
- Regret and Feedback Information in First-Price Sealed-Bid Auctions (Q3117707) (← links)
- Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions (Q4994157) (← links)
- Incentive-Compatible Learning of Reserve Prices for Repeated Auctions (Q4994171) (← links)
- Tight Revenue Gaps among Multiunit Mechanisms (Q5048292) (← links)
- Setting Reserve Prices in Second-Price Auctions with Unobserved Bids (Q5060778) (← links)
- Tight Revenue Gaps Among Simple Mechanisms (Q5123985) (← links)
- Learning in Repeated Auctions (Q5863991) (← links)
- Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (Q5868941) (← links)
- Multi-armed bandits with censored consumption of resources (Q6097147) (← links)
- An \(\alpha \)-regret analysis of adversarial bilateral trade (Q6665707) (← links)