000 | 05206nam a22004333i 4500 | ||
---|---|---|---|
001 | EBC30606106 | ||
003 | MiAaPQ | ||
005 | 20240122002120.0 | ||
006 | m o d | | ||
007 | cr cnu|||||||| | ||
008 | 231124s2023 xx o ||||0 eng d | ||
020 |
_a9783031308413 _q(electronic bk.) |
||
020 | _z9783031308406 | ||
035 | _a(MiAaPQ)EBC30606106 | ||
035 | _a(Au-PeEL)EBL30606106 | ||
040 |
_aMiAaPQ _beng _erda _epn _cMiAaPQ _dMiAaPQ |
||
050 | 4 | _aHD9980-9990 | |
100 | 1 | _aCui, Shiliang. | |
245 | 1 | 0 |
_aInnovative Priority Mechanisms in Service Operations : _bTheory and Applications. |
250 | _a1st ed. | ||
264 | 1 |
_aCham : _bSpringer International Publishing AG, _c2023. |
|
264 | 4 | _c�2023. | |
300 | _a1 online resource (148 pages) | ||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
490 | 1 | _aSpringerBriefs in Service Science Series | |
505 | 0 | _aIntro -- Preface -- Contents -- 1 A Brief Review of Research on Priority Queues with Self-Interested Customers -- 1 Introduction -- 2 Unobservable Queues -- 2.1 Priority Pricing -- 2.2 Priority Auctions -- 3 Observable Queues -- 4 Emerging Research Directions -- References -- 2 Auctions for Trading Queueing Positions -- 1 Introduction -- 2 Model Setup -- 3 Baseline Auction -- 3.1 Trading Rules -- 3.2 Auction Equilibrium -- 4 Social Welfare and Service Provider's Revenue -- 4.1 Social Optimization -- 4.2 Service Provider's Revenue Maximization -- 5 Trading Through an Intermediary -- 5.1 Baseline Auction with a Trade Participation Fee -- 5.2 Augmented Auction: Trading Rulesand a Motivating Example -- 5.3 Auction Equilibrium -- 5.4 Optimal Auction Parameters and Structure -- 5.5 The Value of Trading vs. FIFO -- 6 Conclusion Remarks -- References -- 3 Line-Sitting Services -- 1 Introduction -- 2 Model Preliminaries and FIFO Benchmark -- 2.1 FIFO Benchmark -- 3 Line-Sitting -- 3.1 Comparison Between Line-Sitting and FIFO -- 4 Accommodating Line-Sitting or Selling Priority? -- 4.1 Priority Purchasing -- 4.2 Comparison Between Priority and FIFO -- 4.3 Comparison Between Line-Sitting and Priority -- 5 Three-Way Comparison -- 6 Endogenizing Service Fee B -- 7 Finitely Many Line-Sitters -- 8 Pre-commitment Payment -- 8.1 Revenue of the Line-Sitting Firm -- 8.2 Welfare Implications -- 9 Concluding Remarks -- References -- 4 Queue Scalping -- 1 Introduction -- 2 Model Description -- 3 Analysis of the Single-Scalper Model -- 3.1 What Queues Are Susceptible to Scalping? -- 4 Analysis of the Multi-Scalper Model -- 4.1 What Queues Are Susceptible to Scalping? -- 5 Impact of Queue-Scalping -- 5.1 System Throughput -- 5.2 Consumer Surplus -- 5.3 Social Welfare -- 6 The Long-Run Capacity Response -- 7 Comparison with Line-Sitting -- 8 Effect of Queue Information. | |
505 | 8 | _a9 Concluding Remarks -- References -- 5 Referral Priority Programs -- 1 Introduction -- 2 Model -- 2.1 Queueing Preliminaries -- 3 Equilibrium -- 3.1 Equilibrium Referral Strategies -- 3.2 Existence of Equilibria and Structural Results -- 4 Effectiveness of the Referral Priority Program -- 4.1 Analytic Results -- 4.1.1 System Throughput -- 4.1.2 Customer Welfare -- 4.2 Summary -- 5 Extensions -- 6 Optimal Pricing, Referral Reward Program, and Comparison -- 6.1 Pricing in the Referral Reward Program -- 6.2 Numerical Comparison -- 7 Optimal Scheduling in Referral Priority Programs -- 7.1 Numerical Illustrations -- 7.2 Capacity Implications -- 8 Concluding Remarks -- References -- 6 Distance-Based Service Priority -- 1 Introduction -- 2 Model Preliminaries and FIFO Benchmark -- 2.1 FIFO Service Discipline -- 3 Distance-Based Service Priority Policy -- 4 Comparison between Priority and FIFO Policies -- 5 Two-Dimensional Service Area -- 6 Optimal Service Fee B -- 7 Comparison to Price Discrimination Strategy -- 7.1 Comparing PDS to the FIFO Benchmark -- 7.2 Comparing PDS to the Priority Policy -- 8 Concluding Remarks -- References -- 7 In-Queue Priority Purchase -- 1 Introduction -- 2 Model Description -- 3 Simultaneous Upgrade Rule -- 3.1 Equilibrium Definition -- 3.2 Analysis -- 3.2.1 Step 1: Equilibrium Structure -- 3.2.2 Step 2: Nonexistence of Pure-Strategy Equilibria -- 3.3 A Small Buffer System -- 4 Sequential Upgrade Rule -- 4.1 Equilibrium Definition -- 4.2 Sufficiently Light or Heavy Traffic -- 4.3 Small Buffer Systems -- 4.3.1 K=2 -- 4.3.2 K=3 -- 5 Concluding Remarks -- References. | |
588 | _aDescription based on publisher supplied metadata and other sources. | ||
590 | _aElectronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2023. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. | ||
655 | 4 | _aElectronic books. | |
700 | 1 | _aWang, Zhongbin. | |
700 | 1 | _aYang, Luyi. | |
776 | 0 | 8 |
_iPrint version: _aCui, Shiliang _tInnovative Priority Mechanisms in Service Operations _dCham : Springer International Publishing AG,c2023 _z9783031308406 |
797 | 2 | _aProQuest (Firm) | |
830 | 0 | _aSpringerBriefs in Service Science Series | |
856 | 4 | 0 |
_uhttps://ebookcentral.proquest.com/lib/bacm-ebooks/detail.action?docID=30606106 _zClick to View |
999 |
_c316357 _d316357 |