scholarly journals Dynamic Duopoly with Intertemporal Capacity Constraints

2010 ◽  
Author(s):  
Anita H.J. van den Berg ◽  
Hans Peters ◽  
P. Jean-Jacques Herings
Keyword(s):  
Capacity Constraints ◽  
Dynamic Duopoly

New York Flow Control with Deterministic En Route Capacity Constraints

2009 ◽  
Vol 17 (2) ◽  
pp. 149-172
Author(s):  
Shon Grabbe ◽  
Banavar Sridhar ◽  
Avijit Mukherjee
Keyword(s):  
New York ◽  
Flow Control ◽  
Capacity Constraints

From Assortative to Dissortative Networks: The Role of Capacity Constraints

2010 ◽  
Author(s):  
Michael Koenig ◽  
Claudio J. Tessone ◽  
Yves Zenou
Keyword(s):  
Capacity Constraints

scholarly journals A Welfare Assessment of Revenue Management Systems

2020 ◽  
Vol 19 (1) ◽  
pp. 1-41
Author(s):  
Nicolas Dupuis ◽  
Marc Ivaldi ◽  
Jerome Pouyet
Keyword(s):  
Theoretical Model ◽  
Revenue Management ◽  
Consumer Preferences ◽  
Consumer Surplus ◽  
Capacity Constraints ◽  
Management Systems ◽  
Optimal Pricing ◽  
Pricing Strategies ◽  
Welfare Impact ◽  
Welfare Assessment

AbstractWe study the welfare impact of revenue management, a practice which is widely spread in the transport industry, but whose impact on consumer surplus remains unclear. We develop a theoretical model of revenue management allowing for heterogeneity in product characteristics, capacity constraints, consumer preferences, and probabilities of arrival. We also introduce dynamic competition between revenue managers. We solve this model computationally and recover the optimal pricing strategies. We find that revenue management is generally welfare enhancing as it raises the number of sales.

Review of Network Flow Algorithms David P. Williamson

2021 ◽  
Vol 52 (1) ◽  
pp. 12-15
Author(s):  
S.V. Nagaraj
Keyword(s):  
Graduate Students ◽  
Real World ◽  
Network Flow ◽  
Network Flows ◽  
Optimization Problems ◽  
Capacity Constraints ◽  
Incoming Flow ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Real World Problems

This book is on algorithms for network flows. Network flow problems are optimization problems where given a flow network, the aim is to construct a flow that respects the capacity constraints of the edges of the network, so that incoming flow equals the outgoing flow for all vertices of the network except designated vertices known as the source and the sink. Network flow algorithms solve many real-world problems. This book is intended to serve graduate students and as a reference. The book is also available in eBook (ISBN 9781316952894/US$ 32.00), and hardback (ISBN 9781107185890/US$99.99) formats. The book has a companion web site www.networkflowalgs.com where a pre-publication version of the book can be downloaded gratis.

Sign in / Sign up

Export Citation Format

Share Document