A set of agents with different waiting costs have to receive a service of different length of time from a single provider which can serve only one agent at a time. One needs to form a queue and set up monetary transfers to compensate the agents who have to wait. We prove that no rule satisfies efficiency of queues and coalitional strategy-proofness.mathematical economics;
We address the mechanism design issue for the sequencing problem. We identify the just sequencing ru...
A well-known result in incentive theory is that for a very broad class of decision problems, there i...
We address the scheduling problem of reordering an existing queue into its efficient order through t...
A set of agents with different waiting costs have to receive a service of different length of time f...
We identify the complete class of transfer rules that guarantee strategyproofness of any non-increas...
A set of agents with possibly different waiting costs have to receive the same service one after the...
A set of agents with possibly different waiting costs have to receive the same service one after the...
This paper studies queueing problems with an endogenous number of machines with and without an initi...
In this paper we analyze sequencing situations under incomplete information where agents have interd...
In this paper we analyze the implication of a particular kind of allocation rule called Rawlsian all...
In this paper we analyze the implication of a particular kind of allocation rule called Rawlsian all...
A group of agents are waiting for their job to be processed in a facility. We assume that each agent...
Given a group of agents to be served in a facility, the queueing problem is concerned with finding ...
In this note we study uncertainty sequencing situations, i.e., 1-machine sequencing situations in wh...
We address the mechanism design issue for the sequencing problem. We identify the just sequencing ru...
A well-known result in incentive theory is that for a very broad class of decision problems, there i...
We address the scheduling problem of reordering an existing queue into its efficient order through t...
A set of agents with different waiting costs have to receive a service of different length of time f...
We identify the complete class of transfer rules that guarantee strategyproofness of any non-increas...
A set of agents with possibly different waiting costs have to receive the same service one after the...
A set of agents with possibly different waiting costs have to receive the same service one after the...
This paper studies queueing problems with an endogenous number of machines with and without an initi...
In this paper we analyze sequencing situations under incomplete information where agents have interd...
In this paper we analyze the implication of a particular kind of allocation rule called Rawlsian all...
In this paper we analyze the implication of a particular kind of allocation rule called Rawlsian all...
A group of agents are waiting for their job to be processed in a facility. We assume that each agent...
Given a group of agents to be served in a facility, the queueing problem is concerned with finding ...
In this note we study uncertainty sequencing situations, i.e., 1-machine sequencing situations in wh...
We address the mechanism design issue for the sequencing problem. We identify the just sequencing ru...
A well-known result in incentive theory is that for a very broad class of decision problems, there i...
We address the scheduling problem of reordering an existing queue into its efficient order through t...