🏢 Department of Statistics, University of Oxford
Optimizing the coalition gain in Online Auctions with Greedy Structured Bandits
·1842 words·9 mins·
loading
·
loading
AI Theory
Optimization
🏢 Department of Statistics, University of Oxford
Two novel algorithms, Local-Greedy and Greedy-Grid, optimize coalition gain in online auctions with limited observations, achieving constant regret and problem-independent guarantees while respecting …