Service capacity decision and incentive compatible cost allocation for reporting usage forecasts

DOI10.1016/S0377-2217(03)00246-7zbMath1106.91039MaRDI QIDQ1877034

Suresh Radhakrishnan, Kashi R. Balachandran

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Game theoryCongestionMechanism designTruth-tellingQueuesDelay cost

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

Allocating costs of a shared server with stochastic service parameters and job class priorities, The risk and information sharing of application services supply chain

Cites Work

• Unnamed Item
• Unnamed Item
• Public and private optimization at a service facility with approximate information on congestion
• Cost of congestion, operational efficiency and management accounting
• Class Dominance Characteristics at a Service Facility
• Cost Allocation Revisited: An Optimality Result
• A Differential Approach to Dominant Strategy Mechanisms
• On the Nonexistence of a Dominant Strategy Mechanism for Making Optimal Public Decisions
• The Existence of Efficient and Incentive Compatible Equilibria with Public Goods
• Incentives in a Divisionalized Firm
• Groves' Scheme on Restricted Domains
• Cost Allocation and Opportunity Costs
• Extensions to Class Dominance Characteristics
• Delay Cost and Incentive Schemes for Multiple Users
• Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue