ec'17: learning in repeated auctions with budgets: regret minimization and equilibrium
Published 7 years ago • 566 plays • Length 19:28Download video MP4
Download video MP3
Similar videos
-
17:40
ec'17: the double clinching auction for wagering
-
18:49
ec'19: pacing equilibrium in first-price auction markets
-
20:31
ec'17: approximately efficient two-sided combinatorial auctions
-
24:33
ec'17: truth revelation in approximately efficient combinatorial auctions
-
19:06
ec'17: online auctions and multi-scale online learning
-
17:18
ec'17: repeated sales with multiple strategic buyers
-
20:03
ec'20: improved truthful mechanisms for combinatorial auctions with submodular bidders
-
20:06
ec'17: deferred-acceptance auctions for multiple levels of service
-
1:14:47
optimal auctions with budget constraints
-
17:44
ec'20: simple, credible, and approximately-optimal auctions
-
21:59
ec'18: prior-independent optimal auctions
-
22:39
ec'17: cost-sharing methods for scheduling games under uncertainty
-
17:06
ec'21: robust repeated first price auctions
-
0:59
ec'21 flash video: on the complexity of equilibrium computation in first-price auctions
-
![(agt1e11) [game theory] solving second price auction with complete information: an equilibrium](https://i.ytimg.com/vi/Lk9lLmKbohI/mqdefault.jpg)
8:00
(agt1e11) [game theory] solving second price auction with complete information: an equilibrium
-
56:05
inference on auctions with weak assumptions on information