ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let L>2L>2 be the list length, let 0≤p≤10\leq p\leq 1 be the probability of selecting the highest-priority task, and let τ\tau denote a task's waiting time in stationarity. Vázquez's conjecture.

E(τ)={L,if p<1,1,if p=1.{\mathbb{E}}(\tau)=\begin{cases}L,&\text{if }p<1,\\1,&\text{if }p=1. \end{cases}

For p=1p=1, stationarity means that there are L−1L-1 tasks stuck in the queue. The formula extends the analytically established L=2L=2 case to longer lists; the supplied text does not state whether the conjecture has been resolved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.