Optimal Deterministic Clock Auctions and Beyond

Published on ● Video Link: https://www.youtube.com/watch?v=GUYQFB72VRs



Duration: 23:45
186 views
0


13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
http://itcs-conf.org/

Optimal Deterministic Clock Auctions and Beyond

George Christodoulou (Univesity of Liverpool)
Vasilis Gkatzelis (Drexel University)
Daniel Schoepflin (Drexel University)

https://doi.org/10.4230/LIPIcs.ITCS.2022.49




Other Videos By Simons Institute for the Theory of Computing


2022-01-28Reinforcement Learning (Part I)
2022-01-28Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descr
2022-01-28Separating the NP-Hardness of the Grothendieck problem from the Little-Grothendieck problem
2022-01-28Adaptive Massively Parallel Constant-round Tree Contraction
2022-01-28On Semi-Algebraic Proofs and Algorithms
2022-01-28Beating Classical Impossibility of Position Verification
2022-01-28A lower bound on the space overhead of fault-tolerant quantum computation
2022-01-28Deterministic Dynamic Matching In Worst-Case Update Time
2022-01-28Larger Corner-Free Sets from Combinatorial Degenerations
2022-01-28Secret Sharing, Slice Formulas, and Monotone Real Circuits
2022-01-28Optimal Deterministic Clock Auctions and Beyond
2022-01-28Multiscale entropic regularization for MTS on general metric spaces
2022-01-28Beating the Folklore Algorithm for Dynamic Matching
2022-01-28Correlation-Intractable Hash Functions via Shift-Hiding
2022-01-28Domain Sparsification of Discrete Distributions using Entropic Independence
2022-01-28Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions
2022-01-28Dynamic Matching Algorithms Under Vertex Updates
2022-01-28Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems
2022-01-28Testing Distributions of Huge Objects
2022-01-28Mechanism Design with Moral Bidders
2022-01-28Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE