Related papers: Ordinality in Random Allocation
Algorithmic predictions are increasingly informing societal resource allocations by identifying individuals for targeting. Policymakers often build these systems with the assumption that by gathering more observations on individuals, they…
The chore division problem simulates the fair division of a heterogeneous, undesirable resource among several agents. In the fair division of chores, each agent only gets the disutility from its own piece. Agents may, however, also be…
We consider the fundamental problem of designing a truthful single-item auction with the challenging objective of extracting a large fraction of the highest agent valuation as revenue. Following a recent trend in algorithm design, we assume…
This paper examines the optimal organizational rules that govern the process of dividing a fixed surplus. The process is modeled as a sequential multilateral bargaining game with costly recognition. The designer sets the voting rule --…
In the standard model of fair allocation of resources to agents, every agent has some utility for every resource, and the goal is to assign resources to agents so that the agents' welfare is maximized. Motivated by job scheduling, interest…
Models of auctions or tendering processes are introduced. In every round of bidding the players select their bid from a probability distribution and whenever a bid is unsuccessful, it is discarded and replaced. For simple models, the…
We study a setting in which a principal selects an agent to execute a collection of tasks according to a specified priority sequence. Agents, however, have their own individual priority sequences according to which they wish to execute the…
Randomized mechanisms can have good normative properties compared to their deterministic counterparts. However, randomized mechanisms are problematic in several ways such as in their verifiability. We propose here to derandomize such…
Lost sales inventory models with large lead times, which arise in many practical settings, are notoriously difficult to optimize due to the curse of dimensionality. In this paper we show that when lead times are large, a very simple…
In this work the properties of minority games containing agents which try to winning all the time are studied by means of computational simulations. We have considered several ways of introducing above the rules clever players using…
Social networks are increasingly being used to conduct polls. We introduce a simple model of such social polling. We suppose agents vote sequentially, but the order in which agents choose to vote is not necessarily fixed. We also suppose…
In peer selection agents must choose a subset of themselves for an award or a prize. As agents are self-interested, we want to design algorithms that are impartial, so that an individual agent cannot affect their own chance of being…
We study a multi-armed bandit problem with covariates in a setting where there is a possible delay in observing the rewards. Under some mild assumptions on the probability distributions for the delays and using an appropriate randomization…
Most of the stochastic orders for comparing random variables, considered in the literature, are afflicted with two main drawbacks: (i) lack of connex property and (ii) lack of consideration of any dependence structure between the random…
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of rationalizability. In the case of dominance the criterion of…
In problems involving the allocation of a single non-disposable commodity, we study rules defined on a general domain of preferences requiring only that each preference exhibit a unique global maximum. Our focus is on rules that satisfy a…
We consider the problem of allocating divisible items among multiple agents, and consider the setting where any agent is allowed to introduce diversity constraints on the items they are allocated. We motivate this via settings where the…
A dynamical model for the distribution of resources between competing agents is studied. While global competition leads to the accumulation of all the resources by a single agent, local competition allows for a wider resource distribution.…
In this work we show that the ordering ambiguity on quantization depends on the representation choice. This property is then used to solve unambiguously some particular systems. Finally, we speculate on the consequences for more involved…
The assortment problem in revenue management is the problem of deciding which subset of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment out of all those that are…