ITCS 2022 Session 4
0Chair: Yang Cai
Maximizing revenue in the presence of intermediaries
Gagan Aggarwal, Kshipra Bhawalkar Lane, Guru Guruganesh, and Andres Perlroth (Google Research)
Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for all Distributions
Meryem Essaidi, Matheus Venturyne Xavier Ferreira, and S. Matthew Weinberg (Princeton University)
Cursed yet Satisfied Agents
Yiling Chen and Alon Eden (Harvard University); Juntao Wang (GSAS, Harvard)
Mechanism Design with Moral Bidders
Shahar Dobzinski (Weizmann Institute); Sigal Oren (Ben-Gurion University of the Negev)
Optimal Deterministic Clock Auctions and Beyond
George Christodoulou (Univesity of Liverpool); Vasilis Gkatzelis and Daniel Schoepflin (Drexel University)
13th Innovations in Theoretical Computer Science (ITCS) Conference
Other Videos By Simons Institute for the Theory of Computing
| 2022-02-02 | ITCS 2022 Session 10 |
| 2022-02-02 | ITCS 2022 Session 9 |
| 2022-02-02 | ITCS 2022 Session 8 |
| 2022-02-01 | ITCS 2022 Graduating Bits |
| 2022-02-01 | ITCS 2022 Session 7 |
| 2022-02-01 | Uniform brackets, containers, and combinatorial Macbeath regions |
| 2022-02-01 | FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs |
| 2022-02-01 | Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs |
| 2022-02-01 | ITCS 2022 Session 6 |
| 2022-02-01 | ITCS 2022 Session 5 |
| 2022-02-01 | ITCS 2022 Session 4 |
| 2022-02-01 | ITCS 2022 Session 3 |
| 2022-01-31 | ITCS 2022 Session 2 |
| 2022-01-31 | ITCS 2022 Session 1 |
| 2022-01-31 | Randomness Extraction from Somewhat Dependent Sources |
| 2022-01-31 | Noisy Boolean Hidden Matching with Applications |
| 2022-01-31 | Small Circuits Imply Efficient Arthur-Merlin Protocols |
| 2022-01-29 | Multi-Agent Reinforcement Learning (Part II) |
| 2022-01-29 | Multi-Agent Reinforcement Learning (Part I) |
| 2022-01-29 | Reinforcement Learning (Part II) |
| 2022-01-28 | Reinforcement Learning (Part I) |