[18] Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, and Shang-Hua Teng. Mixture selection, mechanism design, and signaling. In FOCS 2015, pages 1426-1445, 2015.
[19] Phillip J.K. Christoffersen, Andreas A. Haupt, and Dylan Hadfield-Menell. Get it in writing: Formal contracts mitigate social dilemmas in multi-agent RL. In AAMAS 2023, page 448-456, 2023.
[20] Lingyang Chu, Xia Hu, Juhua Hu, Lanjun Wang, and Jian Pei. Exact and consistent interpretation for piecewise linear neural networks: A closed form solution. In KDD 2018, pages 1244-1253, 2018.
[21] Alon Cohen, Argyrios Deligkas, and Moran Koren. Learning approximately optimal contracts. In SAGT 2022, pages 331-346, 2022.
[22] Francesco Croce, Maksym Andriushchenko, and Matthias Hein. Provable robustness of ReLU networks via maximization of linear regions. In AISTATS 2019, pages 2057-2066, 2019.
[23] Francesco Croce and Matthias Hein. A randomized gradient-free attack on ReLU networks. In GCPR 2019, pages 215-227, 2019.
[24] Francesco Della Santa and Sandra Pieraccini. Discontinuous neural networks and discontinuity learning. Journal of Computational and Applied Mathematics, 419:114678, 2023.
[25] Heng Dong, Tonghan Wang, Jiayuan Liu, Chi Han, and Chongjie Zhang. Birds of a feather flock together: A close look at cooperation emergence via multi-agent rl. arXiv preprint arXiv:2104.11455, 2021.
[26] Shaddin Dughmi. On the hardness of signaling. In FOCS 2014, pages 354-363, 2014.
[27] Shaddin Dughmi and Haifeng Xu. Algorithmic Bayesian persuasion. In STOC 2016, pages 412-425, 2016.
[28] Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim. Combinatorial contracts. In FOCS 2021, pages 815-826, 2022.
[29] Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim. Multi-agent contracts. In STOC 2023, pages 1311-1324, 2023.
[30] Paul Dütting, Zhe Feng, Harikrishna Narasimhan, David C. Parkes, and Sai Srivatsa Ravindranath. Optimal auctions through deep learning: Advances in differentiable economics. Journal of the ACM, Forthcoming 2023. First version, ICML 2019, pages 1706-1715. PMLR, 2019.
[31] Paul Dütting, Guru Guruganesh, Jon Schneider, and Joshua Ruizhi Wang. Optimal no-regret learning for one-sided Lipschitz functions. In ICML 2023, volume 202, pages 8836-8850. PMLR, 2023.
[32] Paul Dütting, Tim Roughgarden, and Inbal Talgam-Cohen. Simple versus optimal contracts. In EC 2019, pages 369-387, 2019.
[33] Paul Dütting, Tim Roughgarden, and Inbal Talgam-Cohen. The complexity of contracts. SIAM Journal on Computing, 50(1):211-254, 2021.
[34] Mauro Forti and Paolo Nistri. Global convergence of neural networks with discontinuous neuron activations. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 50(11):1421-1435, 2003.
[35] Xavier Glorot, Antoine Bordes, and Yoshua Bengio. Deep sparse rectifier neural networks. In AISTATS 2011, pages 315-323, 2011.
[36] Yannai A Gonczarowski. Bounding the menu-size of approximately optimal auctions via optimal-transport duality. In STOC 2018, pages 123–131, 2018.
[37] Yannai A Gonczarowski and S Matthew Weinberg. The sample complexity of up-to- $\varepsilon$  multidimensional revenue maximization. Journal of the ACM, 68(3):1-28, 2021.