ITCS 2022 Session 10
0Chair: Ariel Schvartzman
Individual Fairness in Advertising Auctions through Inverse Proportionality
Shuchi Chawla (UT Austin); Meena Jagadeesan (UC Berkeley)
On Fairness and Stability in Two-Sided Matchings
Gili Karni (Weizmann institute of science); Guy Rothblum and Gal Yona (Weizmann Institute of Science)
Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu
Mojtaba Hosseini (Paul Merage School of Business, UCI); Vijay Vazirani (University of California, Irvine)
Interactive Communication in Bilateral Trade
Jieming Mao and Renato Paes Leme (Google Research); Kangning Wang (Duke University)
Multi-Channel Bayesian Persuasion
Yakov Babichenko and Inbal Talgam-Cohen (Technion - Israel Institute of Technology); Haifeng Xu (University of Virginia); Konstantin Zabarnyi (Technion - Israel Institute of Technology)
13th Innovations in Theoretical Computer Science (ITCS) Conference
Other Videos By Simons Institute for the Theory of Computing
| 2022-02-03 | ITCS 2022 Session 20 |
| 2022-02-03 | ITCS 2022 Session 18 |
| 2022-02-03 | ITCS 2022 Session 17 |
| 2022-02-03 | ITCS 2022 Session 16 |
| 2022-02-02 | ITCS 2022 Session 15 |
| 2022-02-02 | ITCS 2022 Session 14 |
| 2022-02-02 | ITCS 2022 Session 13 |
| 2022-02-02 | ITCS 2022 Graduating Bits |
| 2022-02-02 | ITCS 2022 Session 12 |
| 2022-02-02 | ITCS 2022 Session 11 |
| 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 |