Abstract:
We consider a retrial queueing system, in which customer are now aware when the server becomes available and have to actively check it.
Strategic customers decide when to check considering queue length and the age of their information.
We use Dynamic Programming approach to construct customers' cost functions and obtain optimal and/or Nash Equilibrium strategies.
Joint work with Ricky Roet-Green (U. Rochester).
Probability Seminar Yoav Kerner (Ben-Gurion University of the Negev)
Strategic behavior in an observable retrial queue
Share this page
When
29 Nov 2018
from noon
to 29 Nov 2018 1 p.m.
CET (GMT+0100)
Where
KdVI F3.20
Web
Add
