activity
20042025
most citedAn Approximation Algorithm for Stackelberg Network Pricing

65 citations · 65 across the 5 of their papers we have counts for

collaborators

5 papers

stat.CO2025

Sample Complexity of Branch-length Estimation by Maximum Likelihood

David Clancy, Hanbaek Lyu, Sebastien Roch

We consider the branch-length estimation problem on a bifurcating tree: a character evolves along the edges of a binary tree according to a two-state symmetric Markov process, and…

math.PR2025

Likelihood-Based Root State Reconstruction on a Tree: Sensitivity to Parameters and Applications

David Clancy, Hanbaek Lyu, Sebastien Roch +1

We consider a broadcasting problem on a tree where a binary digit (e.g., a spin or a nucleotide's purine/pyrimidine type) is propagated from the root to the leaves through symmetri…

math.ST2025

Likelihood landscape of binary latent model on a tree

David Clancy, Hanbaek Lyu, Sebastien Roch

We investigate the optimization landscape of maximum likelihood estimation (MLE) for the Cavender-Farris-Neyman (CFN) model, a two-state latent tree model fundamental to statistica…

physics.ed-ph2024

Understanding Of Size And Scale And Order-Of-Magnitude Reasoning In Secondary Science: A Teaching Experiment With Worked Examples As Educational Scaffold

Cedric Loretan, Andreas Müller, Marine Delaval +2

Understanding size and scale (USS) and order-of-magnitude reasoning (OMR) are critical for scientific literacy. This study examines an educational approach to enhance these skills…

cs.GT2004★ 65 cited

An Approximation Algorithm for Stackelberg Network Pricing

S. Roch, P. Marcotte, G. Savard

We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assigned to toll-compatible sho…