2 citations · 3 across the 17 of their papers we have counts for
6 papers · 1 filter
Clarification of `Algorithmic Collusion without Threats'
Jason Hartline
This brief note clarifies that the scenario described in Arunachaleswaran et al. (2025) -- titled `Algorithmic Collusion without Threats' -- is not one of collusion, but one where…
Scale-robust Auctions
Jason Hartline, Aleck Johnsen, Yingkai Li
We study auctions that are robust at any scale, i.e., they can be applied to sell both expensive and cheap items and achieve the best multiplicative approximation of the optimal re…
Behavioral Study of Dashboard Mechanisms
Paula Kayongo, Jessica Hullman, Jason Hartline
Visualization dashboards are increasingly used in strategic settings like auctions to enhance decision-making and reduce strategic confusion. This paper presents behavioral experim…
Subgame Optimal and Prior-Independent Online Algorithms
Jason Hartline, Aleck Johnsen, Anant Shah
This paper takes a game theoretic approach to the design and analysis of online algorithms and illustrates the approach on the finite-horizon ski-rental problem. This approach allo…
Fundamental Limits of Throughput and Availability: Applications to prophet inequalities & transaction fee mechanism design
Aadityan Ganesh, Jason Hartline, Atanu R Sinha +1
This paper studies the fundamental limits of availability and throughput for independent and heterogeneous demands of a limited resource. Availability is the probability that the d…
Extension of Minimax for Algorithmic Lower Bounds
Jason Hartline, Aleck Johnsen
This paper considers the use of Yao's Minimax Theorem in robust algorithm design, e.g., for online algorithms, where the algorithm designer aims to minimize the ratio of the algori…