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. 2301.10993
  4. Cited By
Multi-Agent Congestion Cost Minimization With Linear Function
  Approximations

Multi-Agent Congestion Cost Minimization With Linear Function Approximations

26 January 2023
Prashant Trivedi
N. Hemachandra
ArXivPDFHTML

Papers citing "Multi-Agent Congestion Cost Minimization With Linear Function Approximations"

3 / 3 papers shown
Title
Regret Bounds for Stochastic Shortest Path Problems with Linear Function
  Approximation
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
Daniel Vial
Advait Parulekar
Sanjay Shakkottai
R. Srikant
21
15
0
04 May 2021
Provably Efficient Reinforcement Learning with Linear Function
  Approximation Under Adaptivity Constraints
Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraints
Chi Jin
Zhuoran Yang
Zhaoran Wang
OffRL
107
166
0
06 Jan 2021
Optimism in Reinforcement Learning with Generalized Linear Function
  Approximation
Optimism in Reinforcement Learning with Generalized Linear Function Approximation
Yining Wang
Ruosong Wang
S. Du
A. Krishnamurthy
127
135
0
09 Dec 2019
1