2 citations · 3 across the 22 of their papers we have counts for
6 papers · 1 filter
Diffusion-Based Auctions for Multi-Winner Banner Ads
Lilian Sun, Henry Huang, Fucheng Warren Zhu +2
We propose a new framework for banner ad auctions, leveraging diffusion models to allow for multiple bidders to co-win a single banner ad opportunity, and in particular influence t…
Normal-Form Correlation in Markov Games
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina +3
There has been a surge of recent work on correlated equilibrium concepts in Markov games. However, existing results focus on concepts weaker than normal-form correlated equilibria…
Fixed Point Computation: Beating Brute Force with Smoothed Analysis
Idan Attias, Yuval Dagan, Constantinos Daskalakis +2
We propose a new algorithm that finds an -approximate fixed point of a smooth function from the -dimensional unit ball to itself. We use the general framew…
Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex Games
Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson +2
We propose efficient no-regret learning dynamics and ellipsoid-based methods for computing linear correlated equilibria$\unicode{x2014}$a relaxation of correlated equilibria and a…
Maximizing utility in multi-agent environments by anticipating the behavior of other learners
Angelos Assos, Yuval Dagan, Constantinos Daskalakis
Learning algorithms are often used to make decisions in sequential decision-making environments. In multi-agent settings, the decisions of each agent can affect the utilities/losse…
A Lower Bound on Swap Regret in Extensive-Form Games
Constantinos Daskalakis, Gabriele Farina, Noah Golowich +2
Recent simultaneous works by Peng and Rubinstein [2024] and Dagan et al. [2024] have demonstrated the existence of a no-swap-regret learning algorithm that can reach average sw…