1 problem
- 0 votes0 replies0 views
Adaptive dynamic-regret conjecture for non-stationary first-price auctions
Let be the time horizon, let the rounds be partitioned into batches of size , and let denote…
Adaptive dynamic-regret conjecture for non-stationary first-price auctions
Let be the time horizon, let the rounds be partitioned into batches of size , and let denote…