Optimal static pricing for a tree network
From MaRDI portal
Publication:1761804
DOI10.1007/s10479-012-1115-4zbMath1251.90372MaRDI QIDQ1761804
Felipe Caro, David Simchi-Levi
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1115-4
fixed-point equation; stochastic knapsack; product-form; quasiconcavity; Erlang loss system; phone cards; reduced load approximation
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Loss networks
- Generalized concavity
- Computational algorithms for blocking probabilities in circuit-switched networks
- Admission Policies in Loss Queueing Models with Heterogeneous Arrivals
- On the convexity of loss probabilities
- Mean-variance trade-offs in supply contracts
- Convexity Properties of the Erlang Loss Formula
- Algorithms to determine exact blocking probabilities for multirate tree networks
- Monotonicity properties for the stochastic knapsack
- A note on optimal pricing for finite capacity queueing systems with multiple customer classes