Search Results for author:
Found 4 papers, 0 papers with code
Data-Driven Approximations of Chance Constrained Programs in Nonstationary Environments
We study sample average approximations (SAA) of chance constrained programs.
Accelerated consensus in multi-agent networks via memory of local averages
There, the DeGroot update on the current states is followed by a linear combination with the previous states.
Fictitious play in zero-sum stochastic games
We present a novel variant of fictitious play dynamics combining classical fictitious play with Q-learning for stochastic games and analyze its convergence properties in two-player zero-sum stochastic games.
Centrality measures for graphons: Accounting for uncertainty in networks
Using the theory of linear integral operators, we define degree, eigenvector, Katz and PageRank centrality functions for graphons and establish concentration inequalities demonstrating that graphon centrality functions arise naturally as limits of their counterparts defined on sequences of graphs of increasing size.
