Monte Carlo Tree Search Bidding Strategy for Simultaneous Ascending Auctions - Département Informatique et Réseaux Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Monte Carlo Tree Search Bidding Strategy for Simultaneous Ascending Auctions

Résumé

We tackle in this work the problem for a player to efficiently bid in Simultaneous Ascending Auctions (SAA). Although the success of SAA partially comes from its relative simplicity, bidding efficiently in such an auction is complicated as it presents a number of complex strategical problems. No generic algorithm or analytical solution has yet been able to compute the optimal bidding strategy in face of such complexities. By modelling the auction as a turn-based deterministic game with complete information, we propose the first algorithm which tackles simultaneously two of its main issues: exposure and own price effect. Our bidding strategy is computed by Monte Carlo Tree Search (MCTS) which relies on a new method for the prediction of closing prices. We show that our algorithm significantly outperforms state-of-the-art existing bidding methods. More precisely, our algorithm achieves a higher expected utility by taking lower risks than existing strategies.
Fichier principal
Vignette du fichier
rawnet22.pdf (5.77 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03842027 , version 1 (07-11-2022)

Identifiants

Citer

Alexandre Pacaud, Marceau Coupechoux, Aurelien Bechler. Monte Carlo Tree Search Bidding Strategy for Simultaneous Ascending Auctions. 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt) 2022, Sep 2022, Torino, Italy. pp.322-329, ⟨10.23919/WiOpt56218.2022.9930539⟩. ⟨hal-03842027⟩
70 Consultations
140 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More