KDD 2023 - Adversarial Constrained Bidding via Minimax Regret Optimization

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Presents adversarial constrained bidding solved via minimax regret optimization. A KDD conference paper on a specific algorithmic problem with direct application to auction and bidding systems.

A 4-minute video from Association for Computing Machinery (ACM): “KDD 2023 - Adversarial Constrained Bidding via Minimax Regret Optimization”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.