Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines
type: Item
instance of: scholarly article
title: Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines
zbMATH Open document ID: 1282.90050
author: Conan Mukherjee
published in: International Journal of Game Theory
publication date: 2013-03-04T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 91B26
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 6141029
zbMATH Keywords: queueing problem
zbMATH Keywords: weak group strategy-proofness
zbMATH Keywords: continuous mechanism
MaRDI profile type: Publication
full work available at URL: s00182-012-0326-x
OpenAlex ID: W2117864369
cites work: Individual versus group strategy-proofness: when do they coincide?
cites work: A pessimistic approach to the queueing problem
cites work: Incentives in Teams
cites work: Simple sequencing problems with interdependent costs
cites work: Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
cites work: Coalitionally strategy-proof rules in allotment economies with homogeneous indivisible goods
cites work: Groves' Scheme on Restricted Domains
cites work: On the coincidence of the prenucleolus and the Shapley value
cites work: Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
cites work: A characterization of the Shapley value in queueing problems
cites work: Mechanism design in queueing problems
cites work: Achieving the first best in sequencing problems.
cites work: Group strategyproofness in queueing models
cites work: Efficient allocation of heterogeneous commodities with balanced transfers
cites work: Proportional scheduling, split-proofness, and merge-proofness
cites work: Feasible and Continuous Implementation
DOI: 10.1007/S00182-012-0326-X
Recommended article: Group strategyproofness in queueing models
Recommended article: Welfare lower bounds and strategy-proofness in the queueing problem
Recommended article: Q3698615
Recommended article: No-envy, solidarity, and strategy-proofness in the queueing problem
Recommended article: Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
Recommended article: Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
Recommended article: Egalitarian equivalence and strategyproofness in the queueing problem
Recommended article: No-envy in the Queueing Problem with Multiple Identical Machines
Recommended article: An Approximate Method for Treating a Class of Multiqueue Problems
description: scientific article; zbMATH DE number 6141029