Societal Networks 2018
2018-03-26..2018-03-30
Berkeley, United States
as the organisers put it
Societal networks are the engineering subsystems that underlie the daily operation of towns, cities and nations. They include transportation networks, energy networks and markets for the allocation of goods and services. This workshop will explore real-time decision making problems that arise in the control of such systems, with emphasis on estimation and control of urban traffic including trains, buses, private cars and autonomous vehicles, online optimization of power networks, and dynamic pricing and allocation in matching markets.
who it's for
transportation engineers, power systems engineers, urban data scientists, control systems engineers, market designers, networked-systems researchers
topics
electric vehicle charging networks; streaming PMU principal component analysis; decentralized traffic signal control; satisfiability modulo convex programming; posterior sampling for control; real-time inverter orchestration; hierarchical change-point detection; rideshare dispatch and online matching; dynamic pricing in matching markets; urban sensor data hubs
| title | author | length |
|---|---|---|
| A Stochastic Resource-Sharing Network for Electric Vehicle Charging | Bert Zwart | 43m |
Models electric vehicle charging as a queuing network on a distribution tree, using a linearized DistFlow approximation plus utility-maximizing allocations… | ||
| Streaming Analytics for Power Systems: A Tale of Two Time Scales | Le Xie | 30m |
Uses GPS-synced PMU streams (60 Hz) and 4 TB of real grid data to run PCA on streaming PMU windows, finding the top 3–4 components capture >99.5% of variance… | ||
| Real-Time Monitoring, Verification, and Control of Cyber-Physical Systems | Sanjit A. Seshia | 32m |
Introduces satisfiability modulo convex programming — a concrete solver that loops a SAT engine with a convex optimizer that returns infeasibility… | ||
| An Axiomatic Theory of Non Bayesian Social Learning | Ali Jadbabaie | 31m |
Proves one-step Bayesian updating on a network is NP-hard via reductions from subset-sum and exact-cover, then axiomatizes non‑Bayesian rules with four… | ||
| Learning Latent Events from Network Message Logs | R. Srikant | 31m |
Takes 97 million messages with about 1,000 message types and decomposes logs into episodes using a hierarchical change-point detection step that runs in linear… | ||
| Learning to Control Unknown Systems | Rahul Jain | 31m |
Proposes a concrete algorithm that applies posterior sampling to unknown finite MDPs and to linear stochastic systems: maintain a Bayesian posterior over… | ||
| Urban Data & Decisions | Steven Koonin | 48m |
Built a city research stack: a curated data hub (1200 public feeds plus restricted sets), a quantified community in Greenpoint instrumenting ~10,000 people… | ||
| Intelligent Intersections | Pravin Varaiya | 32m |
Intersections concentrate crashes and fatalities and autonomous vehicles still underperform: reported testing shows about 5,000 miles per disengagement versus… | ||
| Decentralized Signal Control for Urban Road Networks | Neil Walton | 29m |
Urban junctions mostly use fixed cycles — about 97% — but simulations with SUMO simulation and comparisons to SCOOT/SCATS show fixed timing limits throughput… | ||
| Marking Sense of Hierarchical Log Data | Damon Wischik | 30m |
Argues that flow-level logs plus occasional program logs can be turned into strings of fork/join actions and compressed with a grammar variational autoencoder… | ||
| Real‐Time Control of Electrical Distribution Grids | Jean-Yves Le Boudec | 31m |
A real-time control system called Comelec orchestrates inverters, batteries and PV by a central grid agent polling device-side resource agents every 100 ms… | ||
| Learning and Optimization of Static and Dynamic Appointments | Jean Walrand | 27m |
Proposes a model-free, data-driven method that learns appointment times from observed service samples using stochastic gradient with infinitesimal perturbation… | ||
| Guaranteeing Timeliness Via Prices... | P. R. Kumar | 25m |
Claims a decentralized, provably optimal scheduler for low‑latency multi‑hop millimeter‑wave networks that meet hard end‑to‑end deadlines by maximizing… | ||
| Data Assimilation for Discrete-Event Simulations | Peter Glynn | 29m |
A major automaker container fleet problem motivates a concrete goal: estimate the probability a factory runs out of containers two days ahead given only… | ||
| Learning in Games with Dynamic Population | Eva Tardos | 48m |
Analyzes repeated congestion/auction games where a fraction of players randomly leave each round (replacement probability p) and shows learning still yields… | ||
| A Marketplace for Data: An Algorithmic Solution | Munther Dahleh | 32m |
Proposes a real-time data marketplace where M fixed sellers supply features, buyers arrive online, allocation gives a buyer feature when bid exceeds a public… | ||
| Optimal Policies for Online Markets with Social Signals | Pascal Van Hentenryck | 29m |
Replicates the MusicLab setup and models sampling with a generalized multinomial logit where visibility, appeal, quality and a popularity exponent r govern… | ||
| Sparse Metric Repair: If It Ain't Broke, Don't Fix It | Anna Gilbert | 33m |
Problem: a symmetric nonnegative distance matrix violates triangle inequalities; goal is to find a perturbation P so D+P is a metric while minimizing the L0… | ||
| Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators | José Correa | 31m |
Private-link tolls can fail to have any pure equilibrium, cycle, or be arbitrarily inefficient; imposing caps below marginal tolls guarantees an equilibrium… | ||
| Risk-averse Selfish Routing | Evdokia Nikolova | 32m |
Models routing as a nonatomic flow with edge delays plus independent noise and users minimizing a mean+variance objective with common risk coefficient R. With… | ||
| A Variational Inequality Framework for Network Games: Existence, Uniqueness, ... | Asu Özdağlar | 31m |
Claims that a variational inequality reformulation unifies existence and uniqueness results for network games by mapping Nash conditions to properties of the… | ||
| Bandit Learning with Positive Externalities | Ramesh Johari | 32m |
Model with arrivals more likely to prefer arms that have earned rewards; positive externality f(x)=x^α (typically linear). Shows UCB can suffer linear expected… | ||
| Online Learning and Optimization in Distributed Energy Systems: Some Problems and Opportunities | Ram Rajagopal | 36m |
Shows practical algorithms for two problems: topology learning using a mutual-information Chow-Liu maximum-weight spanning tree and complex-variable group… | ||
| Incentives and Games in Large Scale Mobility | Alexandre Bayen | 29m |
Cellphone and GPS traces let origin destination inference replace slow surveys using convex programs that reconstruct the Hamilton‑Jacobi value function from… | ||
| The Rideshare Dispatch Problem (Aka Online Bipartite Matching with Supply Externalities) | Sid Banerjee | 33m |
Model has n stations, K identical cars, Poisson origin-destination arrivals and zero trip times; objective is long-run miss rate when supply can be pulled for… | ||
| Time Series Analysis via Matrix Estimation | Devavrat Shah | 30m |
Transforms a single noisy, partially observed series into a matrix by chopping into length-L columns, runs a black‑box matrix estimation routine, then undoes… | ||
| Dynamic Matching Models | Ana Bušić | 32m |
First come first matched on a general compatibility graph has maximal stability whenever the graph is non‑bipartite and the stationary law factorizes into a… | ||
| Clearing Matching Markets Efficiently: Informative Signals and Match Recommendations | Itai Ashlagi | 29m |
Shows that under a latent utility model (public score plus iid private shock with bounded hazard rate and limited tier range) a modified deferred‑acceptance… | ||
| Irrational Agents and the Power Grid | Sean Meyn | 32m |
Claim: real-time marginal prices fail as a coordination mechanism because power is not the commodity consumers value — temperature and thermal inertia are, so… | ||
| Mobilizing Grid Flexibility for Renewables Integration through Enhanced Computation | Shmuel Oren | 41m |
Research shows using topology control and flexible line rating as recourse in a two-stage stochastic unit commitment cuts dispatch cost substantially… | ||
| nothing matches | ||