Coordination via predictive assistants from a game-theoretic view
share
We study machine learning-based assistants that support coordination between humans in congested facilities via congestion forecasts. In our theoretical analysis, we use game theory to study how an assistant's forecast that influences the outcome relates to Nash equilibria, and how they can be reached quickly in congestion game-like settings. Using information theory, we investigate approximations to given social choice functions under privacy constraints w.r.t. assistants. And we study dynamics and training for a specific exponential smoothing-based assistant via a linear dynamical systems and causal analysis. We report experiments conducted on a real congested cafeteria with about 400 daily customers where we evaluate this assistant and prediction baselines to gain further insight.
READ FULL TEXT