Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
We introduce an online learning algorithm in the bandit feedback model that, once adopted
by all agents of a congestion game, results in game-dynamics that converge to an $\epsilon …
by all agents of a congestion game, results in game-dynamics that converge to an $\epsilon …
Spectral Independence a New Tool to Analyze Markov Chains
K Liu - 2023 - search.proquest.com
We introduce a versatile technique called spectral independence for the analysis of Markov
chain Monte Carlo algorithms in high-dimensional probability and statistics. We rigorously …
chain Monte Carlo algorithms in high-dimensional probability and statistics. We rigorously …
Integer Traffic Assignment Problem: Algorithms and Insights on Random Graphs
Path optimization is a fundamental concern across various real-world scenarios, ranging
from traffic congestion issues to efficient data routing over the internet. The Traffic …
from traffic congestion issues to efficient data routing over the internet. The Traffic …
Approximate sampling and counting of graphs with near-regular degree intervals
G Amanatidis, P Kleer - arXiv preprint arXiv:2110.09068, 2021 - arxiv.org
The approximate uniform sampling of graphs with a given degree sequence is a well-known,
extensively studied problem in theoretical computer science and has significant …
extensively studied problem in theoretical computer science and has significant …