Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Fair Queueing / by Youngsub Chun.
Author
Chun, Youngsub, author.
ISBN
9783319337715 (electronic book)
3319337718 (electronic book)
9783319337708
3319337718 (electronic book)
9783319337708
Published
Switzerland : Springer International Publishing : Imprint: Springer, 2016.
Language
English
Description
1 online resource.
Call Number
T57.9
Dewey Decimal Classification
519.82
Summary
This monograph provides a detailed analysis on fair queueing rules from a normative, a strategic, and a non-cooperative viewpoint. The queueing problem is concerned with the following situation: There is a group of agents who must be served in a facility. The facility can handle only one agent at a time and agents incur waiting costs. The problem is to find the order in which to serve agents and monetary transfers they should receive. The queueing problem has been studied extensively in the recent literature.
Bibliography, etc. Note
Includes bibliographical references.
Access Note
Access limited to authorized users.
Digital File Characteristics
text file PDF
Source of Description
Online resource; title from PDF title page (viewed August 29, 2016).
Series
Studies in choice and welfare.
Available in Other Form
Print version: 9783319337708
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
Table of Contents
Introduction
Basic Concepts
Cooperative Game Theoretic Approach
Independence, Monotonicity, and Balanced Consistency
No-envy
Startegyproofness
Strategyproofness and Egalitarian Equivalence
Subgroup Additivity
A Non-Cooperative Approach
Queueing Problems with Two.
Basic Concepts
Cooperative Game Theoretic Approach
Independence, Monotonicity, and Balanced Consistency
No-envy
Startegyproofness
Strategyproofness and Egalitarian Equivalence
Subgroup Additivity
A Non-Cooperative Approach
Queueing Problems with Two.