{"type":"video","version":"1.0","html":"<iframe width=\"560\" height=\"315\" sandbox=\"allow-same-origin allow-scripts allow-popups allow-forms\" title=\"&quot;Bidding efficiently in Simultaneous Ascending Auctions using Monte Carlo Tree Search&quot; Pacaud (TP)\" src=\"https://peertube.r2.enst.fr/videos/embed/f87423bf-c705-49e2-acc4-ee2fbb9a868f\" frameborder=\"0\" allowfullscreen></iframe>","width":560,"height":315,"title":"\"Bidding efficiently in Simultaneous Ascending Auctions using Monte Carlo Tree Search\" Pacaud (TP)","author_name":"LINCS seminar","author_url":"https://peertube.r2.enst.fr/video-channels/lincs_seminar","provider_name":"PeerTube","provider_url":"https://peertube.r2.enst.fr","thumbnail_url":"https://peertube.r2.enst.fr/lazy-static/previews/450ba74d-41fe-49f3-8c40-940360b11ee0.jpg","thumbnail_width":850,"thumbnail_height":480}