Incomplete information and multiple machine queueing problems

DOI10.1016/J.EJOR.2003.10.050MaRDI QIDQ1776969zbMATH OpenOpenAlexFDO

Authors Manipushpak Mitra

Publication date 12 May 2005

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

Full work available at URL http://hdl.handle.net/10419/78417

zbMATH Keywords

first best implementabilityqueueing problems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Mechanism design in queueing problems
• On optimal mechanism design for a sequencing problem
• Simple sequencing problems with interdependent costs
• Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines
• Achieving the first best in sequencing problems.

Cites work

• Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
• Flow-shops with a dominant machine
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Groves' Scheme on Restricted Domains
• scientific article; zbMATH DE number 3650233 (Why is no real title available?)
• scientific article; zbMATH DE number 3893204 (Why is no real title available?)
• Incentives in Teams
• Mechanism design in queueing problems
• On the balancedness of multiple machine sequencing games
• On the existence of optimal truth-dominant mechanisms
• On the Generic Nonoptimality of Dominant-Strategy Allocation Mechanisms: A General Theorem That Includes Pure Exchange Economies
• On the Nonexistence of a Dominant Strategy Mechanism for Making Optimal Public Decisions
• Sequencing games

Cited in

(14)

• Second-best mechanisms in queuing problems without transfers: the role of random priorities
• Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs
• Achieving the first best in sequencing problems.
• Recent developments in the queueing problem
• Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
• No-envy in the queueing problem with multiple identical machines
• Group strategyproofness in queueing models
• INFORMATION AND UNCERTAINTY IN A QUEUING SYSTEM
• Mechanism design in queueing problems
• Comments on: ``Recent developments in the queueing problem
• Queueing games with an endogenous number of machines
• Generalized welfare lower bounds and strategyproofness in sequencing problems
• Simple sequencing problems with interdependent costs
• Efficient allocation of heterogeneous commodities with balanced transfers

This page was built for publication: Incomplete information and multiple machine queueing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1776969)