Second-best mechanisms in queuing problems without transfers: the role of random priorities (Q1680100): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.mathsocsci.2017.08.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2761005027
@@ Property / OpenAlex ID: W2761005027 / rank @@
+Normal rank
@@ Property / cites work @@
+No-envy in queueing problems
@@ Property / cites work: No-envy in queueing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Egalitarian equivalence and strategyproofness in the queueing problem
+Normal rank
@@ Property / cites work @@
+Scheduling with Opting Out: Improving upon Random Priority
+Normal rank
@@ Property / cites work @@
+Simple sequencing problems with interdependent costs
+Normal rank
@@ Property / cites work @@
+Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
+Normal rank
@@ Property / cites work @@
+A characterization of the Shapley value in queueing problems
+Normal rank
@@ Property / cites work @@
+Mechanism design in queueing problems
@@ Property / cites work: Mechanism design in queueing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Achieving the first best in sequencing problems.
@@ Property / cites work: Achieving the first best in sequencing problems. / rank @@
+Normal rank
@@ Property / cites work @@
+On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
+Normal rank
@@ Property / cites work @@
+Proportional scheduling, split-proofness, and merge-proofness
+Normal rank