.png){kind=icon}
Return
Attention allocation for decision making queues
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2013.11.028.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the optimal servicing of a queue with sigmoid server performance. There are various systems with sigmoid server performance, including systems involving human decision making, visual perception, human machine communication and advertising response. Tasks arrive at the server according to a Poisson process. Each task has a deadline that is incorporated as a latency penalty. We investigate the trade-off between the reward obtained by processing the current task and the penalty incurred due to the tasks waiting in the queue. We study this optimization problem in a Markov decision process (MDP) framework. We characterize the properties of the optimal policy for the MDP and show that the optimal policy may drop some tasks; that is, may not process a task at all. We determine an approximate solution to the MDP using the certainty-equivalent receding horizon optimization framework and derive performance bounds on the proposed receding horizon policy. We also suggest guidelines for the design of such queues. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Sigmoid utility
Human decision making
Control of queues
Human-robot interaction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
View more organizations
Cited Papers
Adjuvant chemotherapy in early breast cancer and incidence of new primary malignancies.png)
The Lancet
The LancetIF0
PREAI
ShareSaveO-15 - Latent class analysis of ptsd symptoms among 6,733 New York City students exposed to 9/11
PREAI
ShareSaveThe shape of advertising response functions revisited: A model of dynamic probabilistic thresholds
PREAI
ShareSave
ShareSaveShareSave View more