On the Optimal Scheduling of Attention

Kfir Eliaz, Daniel Fershtman and Alexander Frug

No 16364, CEPR Discussion Papers from Centre for Economic Policy Research

Abstract: We consider a decision-maker sequentially choosing which task to attend to when payoffs depend on both the chosen and unchosen tasks. We show that when tasks are substitutes (complements) such that the flow payoffs are a sum (product) of the tasks’ outputs, the optimal policy is an index policy, generalizing the independence of irrelevant alternatives (IIA) property known in the classic multi-armed bandit problem. We illustrate the usefulness of our model through several applications, including repeated bargaining, dynamic occupational choice, on-the-job training, R\&D, and dynamic supervision.

Keywords: Allocation of attention; Scheduling; Time management; Multitasking; Task juggling; Multi-armed bandits (search for similar items in EconPapers)
Date: 2021-07
References: Add references at CitEc
Citations:

Downloads: (external link)
https://cepr.org/publications/DP16364 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cpr:ceprdp:16364

Ordering information: This working paper can be ordered from
https://cepr.org/publications/DP16364

Access Statistics for this paper

More papers in CEPR Discussion Papers from Centre for Economic Policy Research 33 Great Sutton Street, London EC1V 0DX, UK.
Bibliographic data for series maintained by CEPR ().