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. 1906.06361
  4. Cited By
Online Allocation and Pricing: Constant Regret via Bellman Inequalities

Online Allocation and Pricing: Constant Regret via Bellman Inequalities

14 June 2019
Alberto Vera
Siddhartha Banerjee
I. Gurvich
    OffRL
ArXivPDFHTML

Papers citing "Online Allocation and Pricing: Constant Regret via Bellman Inequalities"

6 / 6 papers shown
Title
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
Jiashuo Jiang
Will Ma
Jiawei Zhang
26
14
0
03 Jan 2025
Infrequent Resolving Algorithm for Online Linear Programming
Infrequent Resolving Algorithm for Online Linear Programming
Guokai Li
Yuan Wang
Mingjie Li
31
1
0
01 Aug 2024
Hindsight Learning for MDPs with Exogenous Inputs
Hindsight Learning for MDPs with Exogenous Inputs
Sean R. Sinclair
Felipe Vieira Frujeri
Ching-An Cheng
Luke Marshall
Hugo Barbalho
Jingling Li
Jennifer Neville
Ishai Menache
Adith Swaminathan
18
23
0
13 Jul 2022
Fairer LP-based Online Allocation via Analytic Center
Fairer LP-based Online Allocation via Analytic Center
Guanting Chen
Xiaocheng Li
Yinyu Ye
FaML
18
8
0
27 Oct 2021
Resourceful Contextual Bandits
Resourceful Contextual Bandits
Ashwinkumar Badanidiyuru
John Langford
Aleksandrs Slivkins
40
117
0
27 Feb 2014
Bounded regret in stochastic multi-armed bandits
Bounded regret in stochastic multi-armed bandits
Sébastien Bubeck
Vianney Perchet
Philippe Rigollet
71
91
0
06 Feb 2013
1