1996
DOI: 10.1016/0377-2217(95)00265-0
|View full text |Cite
|
Sign up to set email alerts
|

Pricing, routing, and incentive compatibility in multiserver queues

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
1

Year Published

2001
2001
2019
2019

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 40 publications
(18 citation statements)
references
References 25 publications
0
17
1
Order By: Relevance
“…There exists a critical p , meaning that the internal firm will set a higher price than the commercial firm in period 1. This result is different from the conclusions of Mendelson and Whang (1990), Bradford (1996) and Afeche and Mendelson (2004). They all demonstrated that the optimal price of a particular customer class in the profit maximization model was always higher than the corresponding optimal price in the net value maximization model.…”
Section: Numerical Analysiscontrasting
confidence: 82%
“…There exists a critical p , meaning that the internal firm will set a higher price than the commercial firm in period 1. This result is different from the conclusions of Mendelson and Whang (1990), Bradford (1996) and Afeche and Mendelson (2004). They all demonstrated that the optimal price of a particular customer class in the profit maximization model was always higher than the corresponding optimal price in the net value maximization model.…”
Section: Numerical Analysiscontrasting
confidence: 82%
“…Bradford (1996) and Lederer and Li (1997) discussed a multipleagent case with different waiting or delay costs. Ugarte and Oren (2000) compared the efficiency of three coordination policies of internal supply chains: Centralized command and control, centralized revelation, and decentralized revelation.…”
Section: Revelation Mechanism Designmentioning
confidence: 98%
“…Since Myerson (1979) gave the revelation principle, considerable researchers devoted themselves to establish incentive schemes to induce truthful information (see, Bradford, 1996;Lim, 2000;Ugarte and Oren, 2000;Sen, 2005;Hempelmann, 2006). Bradford (1996) and Lederer and Li (1997) discussed a multipleagent case with different waiting or delay costs.…”
Section: Revelation Mechanism Designmentioning
confidence: 99%
“…where it is to be remembered that P, is a function of (N,a -~ N,B) through (2) and c,r is a functmn of (Nlr+ N2~) through (1). We solve the problem by first using ordinary Lagranglan methods to find the values of N t A, N2A, and N2B that maxanuze (4) subject to equahty constraints (7b) and (7c), then a is calculated from (7a) The non-negativity constrmnt for Nza as then checked, and is imposed as an equahty if needed.…”
Section: No-toll Reg~ne (Nt): T a = T B =mentioning
confidence: 99%