A platform for massive agent-based simulation and its evaluation
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
We consider packet routing when packets are injected continuously into a network. We develop an adversarial theory of queuing aimed at addressing some of the restrictions inherent in probabilistic analysis and queuing theory based on time-invariant stochastic generation. We examine the stability of queuing networks and policies when the arrival process is adversarial, and provide some preliminary results in this direction. Our approach sheds light on various queuing policies in simple networks, and paves the way for a systematic study of queuing with few or no probabilistic assumptions.
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
Gang Liu, Michael Sun, et al.
ICLR 2025
Aditya Malik, Nalini Ratha, et al.
CAI 2024
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011