ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2202.00237
  4. Cited By
Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the
  Gap Between Learning in Extensive-Form and Normal-Form Games

Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games

1 February 2022
Gabriele Farina
Chung-Wei Lee
Haipeng Luo
Christian Kroer
ArXivPDFHTML

Papers citing "Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games"

6 / 6 papers shown
Title
Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
Yang Cai
Gabriele Farina
Julien Grand-Clément
Christian Kroer
Chung-Wei Lee
Haipeng Luo
Weiqiang Zheng
50
6
0
15 Jun 2024
Last-Iterate Convergence with Full and Noisy Feedback in Two-Player
  Zero-Sum Games
Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games
Kenshi Abe
Kaito Ariu
Mitsuki Sakamoto
Kenta Toyoshima
Atsushi Iwasaki
31
11
0
21 Aug 2022
Near-Optimal $Φ$-Regret Learning in Extensive-Form Games
Near-Optimal ΦΦΦ-Regret Learning in Extensive-Form Games
Ioannis Anagnostides
Gabriele Farina
T. Sandholm
28
7
0
20 Aug 2022
Regret Minimization and Convergence to Equilibria in General-sum Markov
  Games
Regret Minimization and Convergence to Equilibria in General-sum Markov Games
Liad Erez
Tal Lancewicki
Uri Sherman
Tomer Koren
Yishay Mansour
40
25
0
28 Jul 2022
Efficient Phi-Regret Minimization in Extensive-Form Games via Online
  Mirror Descent
Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent
Yu Bai
Chi Jin
Song Mei
Ziang Song
Tiancheng Yu
OffRL
52
19
0
30 May 2022
Faster Game Solving via Predictive Blackwell Approachability: Connecting
  Regret Matching and Mirror Descent
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent
Gabriele Farina
Christian Kroer
T. Sandholm
48
72
0
28 Jul 2020
1