activity
20192023
most citedThe Principle of Optimality in Dynamic Programming: A Pedagogical Note

2 citations · 7 across the 7 of their papers we have counts for

collaborators

12 papers

math.PR2023

Invariant Distributions in Nonlinear Markov Chains with Aggregators: Theory, Computation, and Applications

Bar Light

We study the properties of a subclass of stochastic processes called discrete time nonlinear Markov chains with an aggregator, which naturally appear in various topics such as stra…

math.OC2023★ 2 cited

The Principle of Optimality in Dynamic Programming: A Pedagogical Note

Bar Light

The principle of optimality is a fundamental aspect of dynamic programming, which states that the optimal solution to a dynamic optimization problem can be found by combining the o…

cs.GT2022★ 1 cited

Equilibria in Repeated Games under No-Regret with Dynamic Benchmarks

Ludovico Crippa, Yonatan Gur, Bar Light

In repeated games, strategies are often evaluated by their ability to guarantee the performance of the single best action that is selected in hindsight, a property referred to as \…

cs.GT2022

Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence

Jason Gaitonde, Yingkai Li, Bar Light +2

We study the aggregate welfare and individual regret guarantees of dynamic \emph{pacing algorithms} in the context of repeated auctions with budgets. Such algorithms are commonly u…

econ.TH2022★ 2 cited

Social Learning under Platform Influence: Consensus and Persistent Disagreement

Ozan Candogan, Nicole Immorlica, Bar Light +1

Individuals increasingly rely on social networking platforms to form opinions. However, these platforms typically aim to maximize engagement, which may not align with social good.…

math.CA2020

Hermite-Hadamard inequalities for (p,a,b)-convex functions

Bar Light

A function is called -convex if is times continuously differentiable, is convex and increasing, and for a…