Algorithmic Challenges in Ensuring Fairness at the Time of Decision

Greater Price Stability Without Sacrificing Optimal Revenue Guarantees In today’s digital marketplaces, sellers often rely on dynamic pricing—changing prices frequently—to optimize revenue. However, frequent price changes can undermine customer trust. In a new study published in Operations Research, researchers from the U.S. Naval Academy, MIT Sloan, and the University of Illinois at Chicago demonstrate that it is possible to restrict price changes to only decrease over time—through strategic markdowns—while still achieving strong performance guarantees. Their research shows that optimizing pricing trajectories, even under monotonicity constraints, does not compromise optimal regret guarantees for maximizing revenue. This finding challenges the prevailing assumption that taming price experimentation may hinder success. The work opens new avenues for how online platforms can rethink pricing strategies to foster consumer loyalty without sacrificing profitability.