Below is the list of speakers, their talk titles and their slides. Abstracts, bios and a detailed schedule can be found here.
Talks as well as breakfasts and lunches will be in Duffield Hall and Philips Hall (which are connected buildings); see the google map here.
You can find the full list of participants here
We also want to draw your attention to two new online facets of this upcoming conference (see the bottom of this page)
Please see also the Poster session page if you wish to present a poster.
Onno Boxma (Eindhoven University of Technology): From the single server queue to reflected autoregressive processes [Slides]
Daniele Cappelletti (Politecnico di Torino): Solving the chemical recurrence conjecture in 2D [Slides]
Carri Chan (Columbia University): Managing queues with different resource requirement [Slides]
Todd Coleman (Stanford University): Kuramoto von Mises Autoregressive Statistical Models [Talk Cancelled]
Sergey Foss (Heriot-Watt University): Migration-Contagion Processes [Slides]
Nicolas Gast (INRIA): Computing the bias of mean field approximation [Slides]
Varun Gupta (University of Chicago): Menu design of a bipartite matching queueing system with strategic users [Slides]
Sophie Haupthenne (University of Melbourne): The probabilities of extinction in a branching random walk [Slides]
Rouba Ibrahim (University College London): Size-based scheduling in service systems [Slides]
Jon Kleinberg (Cornell University): The Challenge of Understanding What Users Want: Inconsistent Preferences and Engagement Optimization [Slides]
Henry Lam (Columbia): Towards Model-Agnostic Rare-Event Simulation with Guarantees [Slides]
Nelly Litvak (University of Twente): Red Light – Green Light solution for large Markov chains [Slides]
Alexandre Proutiere (KTH): Regret in Online Recommendation Systems [Slides]
Kavita Ramanan (Brown University): Beyond mean-field limits in the study of large-scale networks [Slides]
R. Srikant (University of Illinois, Urbana-Champaign): A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP [Slides]
Neil Walton (University of Manchester): Regret Analysis of a Markov Policy Gradient Algorithm for Multi-arm Bandits [Slides]
Mengdi Wang (Princeton University): Thompson Sampling-Guided Directed Evolution for Sequence Optimization [Slides]
Weina Wang (Carnegie Mellon University): Sharp Waiting-Time Bounds for Multiserver Jobs [Slides]
Kuang Xu (Stanford University): Information design for load balancing [Slides]
Christina Yu (Cornell University): Graph Agnostic Randomized Experimental Design under Heterogeneous Linear Network Interference and Beyond [Slides]
Online access: For those who are not able to travel at this time and for the interests of the greater community of researchers, we would like to draw your attention to two new online facets of this upcoming conference:
- On Tuesday June 21 from 4:00 to 5:30 PM EDT, we will hold a special interactive panel session – Stochastic Networks: Past, Present, and Future. With discussion as a hallmark of Stochastic Networks past, expect to join with prior conference organizers and other community members in an introspective dialogue on this broad area of work. Confirmed online participants include Peter Glynn, Mike Harrison, Frank Kelly, Peter Taylor, Ruth Williams, and many more! This event is the first of its kind for the conference, and it is open to all. The time and date have been selected to accommodate participation worldwide. Register here to receive the Zoom meeting link to this Stochastic Networks hybrid forum:
usc.zoom.us/meeting/register/… - Additionally, we are excited to announce that research presentations at the conference will be available for live-streaming through a Zoom webinar. Use the following link to access the live stream of the talks:cornell.zoom.us/j/…
Passcode: 2022
Webinar ID: 976 3027 6119 Please note that this link is separate from the hybrid forum panel link in the bullet above, as the talks will be Zoomed in Webinar format rather than Meeting.