We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of n players, the maximin share of a single player is the best she can guarantee to herself, if she would partition the items in any way she prefers, into n bundles, and then receive her least desirable bundle. The objective then is to find an allocation, so that each player...

R management models traditionally assume that future demand is unknown but can be described by a stochastic process or a probability distribution. Demand is, however, often difficult to characterize, especially in new or nonstationary markets. In this paper, we develop robust formulations for the capacity allocation problem in revenue management using the maximin and the minimax regret criteria...

In a party-based election, the voters are grouped into parties and all voters of a party are assumed to vote according to the party preferences over the candidates. Hence, once the party preferences are declared the outcome of the election can be predicted. However, in the actual election, the members of some “instable" parties often leave their own parties to join other parties. We introduce t...

It has been proposed that animals and humans might choose a speedaccuracy tradeoff that maximizes reward rate. For this utility function the simple drift-diffusion model of two-alternative forced-choice tasks predicts a parameter-free optimal performance curve that relates normalized decision times to error rates. However, behavioral data indicate that only ≈ 30% of subjects achieve optimality,...

Abstract Multiple testing problems (MTPs) are a staple of modern statistical analysis. The fundamental objective MTPs is to reject as many false null hypotheses possible (that is, maximize some notion power), subject controlling an overall measure discovery, like family-wise error rate (FWER) or discovery (FDR). In this paper we provide generalizations the optimal Neyman-Pearson test for single...

Distributive justice concerns the moral principles by which we seek to allocate resources fairly among diverse members of a society. Although the concept of fair allocation is one of the fundamental building blocks for societies, there is no clear consensus on how to achieve "socially just" allocations. Here, we examine neurocognitive commonalities of distributive judgments and risky decisions....

We consider a cooperative model of bargaining where the location of the disagreement point may be uncertain. Based on the maximin criterion, we formulate an ex ante efficiency condition and characterize the class of bargaining solutions satisfying this axiom. These solutions are generalizations of the monotone path solutions. Adding individual rationality yields a subclass of these solutions. B...

We study the complexity of Destructive Shift Bribery. In this problem, we are given an election with a set of candidates and a set of voters (ranking the candidates from best to worst, each), a despised candidate d (typically, one of the current winners), a budget B, and prices for shifting d down in voters’ rankings. The goal is to ensure that d is not a winner of the election. We show that th...

Continued With uncertainty taken directly on the noise samples, we develop an estimation-detection theoretic approach: the detection statistic preserves the structure of the quadrature matched filter, but in place of the linear sample mean, a minimax robust estimator of the random amplitude is substituted. This test is shown to be asymptotically maximin optimal (in the sense of Huber) for a wid...