arXiv:2607. 08012v1 Announce Type: cross Abstract: This paper studies an online variant of the assistance games framework, where an informed agent and an uninformed agent repeatedly interact over $T$ timesteps to optimize a common reward function.
By Nivasini Ananthakrishnan, Mark Bedaywi, Michael I. Jordan, Stuart Russell, Nika Haghtalab
arXiv:2608. 06520v1 Announce Type: new Abstract: We study online cooperative control of a multi-agent system under Byzantine attacks.
By Ximing Sun, Yue Wang
arXiv:2608. 16699v1 Announce Type: cross Abstract: Motivated by modern marketplaces, where the platform or the seller routinely gathers detailed user profiles, we study a novel learning theoretic model that simultaneously involves information and mechanism design.
By Maria-Florina Balcan, Tejas Pagare, Karan Singh
arXiv:2503. 01701v2 Announce Type: replace-cross Abstract: Most microeconomic models of interest involve optimizing a piecewise linear function.
By Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti
arXiv:2607. 14877v1 Announce Type: new Abstract: Reachability is the most fundamental logical objective, yet it is notoriously difficult to learn in reinforcement learning settings: even for Markov decision processes, PAC learning of reachability is impossible without additional assumptions.
By Ali Asadi, Krishnendu Chatterjee, Pavol Kebis
arXiv:2608. 02480v1 Announce Type: cross Abstract: With AI systems gaining more access to individuals' information, it is important to protect privacy when reporting statistical answers.
By Jinwon Sohn, Veronika Ro\v{c}kov\'a