BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:710@lincs.fr
DTSTART;TZID=Europe/Paris:20220615T150000
DTEND;TZID=Europe/Paris:20220615T160000
DTSTAMP:20220705T095340Z
URL:https://www.lincs.fr/events/bidding-efficiently-in-simultaneous-ascend
 ing-auctions-using-monte-carlo-tree-search/
SUMMARY:Bidding efficiently in Simultaneous Ascending Auctions using Monte
 Carlo Tree Search
DESCRIPTION: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.
CATEGORIES:Seminars,Youtube
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20220327T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR