Basic Concepts

Youngsub Chun

Chapter Chapter 2 in Fair Queueing, 2016, pp 7-14 from Springer

Abstract: Abstract This chapter provides basic concepts needed to solve the queueing problem. First, we formally introduce the queueing problem and present basic axioms. Then, we define prominent rules for the problem and briefly discuss their properties.

Keywords: Pareto Indifference; Efficient Queue; Strategyproofness; Transfer Rules; Pivot Rule (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:stcchp:978-3-319-33771-5_2

Ordering information: This item can be ordered from
http://www.springer.com/9783319337715

DOI: 10.1007/978-3-319-33771-5_2

Access Statistics for this chapter

More chapters in Studies in Choice and Welfare from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().