Peer review of research proposals and articles is an essential element in research and development processes worldwide. Here we consider a problem that, to the best of our knowledge, has not been addressed until now: how to assign subsets of proposals to reviewers in scenarios where the...

In this paper, we state and study the problem of selecting a product mix and a dispatching rule for a jobshop system to maximize its revenue rate over an infinite planning horizon. We solve the problem of obtaining maximum revenue by selecting a product mix and determine a schedule. The designed...

We analyse assignment problems in which not every agent is controlled by the central planner. The autonomous agents search for vacant tasks guided by their own preference orders over available tasks. The goal of the central planner is to maximise the total value of the assignment, taking into...

We study the problem of allocating m identical items among nm agents with unit demand and private value for consuming the good. We allow payments and focus on dominant-strategy implementation. In the absence of an auctioneer who can absorb payments collected from the agents, the payments must be...

We consider the problem of dividing a homogeneous divisible good among n players. Each player holds a private non-negative utility function that depends only on the amount of the good that he receives. We define the fair share of a player P to be the average utility that a player could receive...

We consider a single indivisible object auctioned in an ascending bid English auction. Two variations of this auction are compared with respect to the seller's revenue. In the first mechanism the participants observe the identity of a bidder that drops from the auction while in the second...