We study fair resource allocation when the resources contain a mixture of divisible and indivisible goods, focusing on well-studied fairness notion maximin share (MMS). With only full MMS may not exist, but constant multiplicative approximate always does. analyze how approximation guarantee would be affected to allocated also goods. In particular, we show that worst-case with mixed goods is no ...

Since the seminal paper of Nash [7] game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in 2-player non-zero-sum strategic games, whose Nash equilibria are only mixed.

The maximin share guarantee is, in the context of allocating indivisible goods to a set of agents, a recent fairness criterion. A solution achieving a constant approximation of this guarantee always exists and can be computed in polynomial time. We extend the problem to the case where the goods collectively received by the agents satisfy a matroidal constraint. Polynomial approximation algorith...

The Maximin Efficiency-Robust Test idea of Gastwirth (1966) was to maximize the minimum asymptotic power (for fixed size) versus special local families of alternatives over some specially chosen families of score statistics. This approach is reviewed from a general decision-theoretical perspective, including some Bayesian variants. For two-sample censored-data rank tests and stochastically orde...

To optimize a connecting rod satisfying fatigue life, metamodel-based design optimization is proposed. To approximately predict both volume and fatigue life of connecting rod, kriging metamodel is constructed based on maximin eigenvalue sampling. Fatigue analysis is accomplished for the calculation of fatigue life. The results of metamodel-based design optimization are compared with those of cl...

This article studies an inter-temporal optimization problem under a criterion that is combination of Ramsey’s and Rawls’s criteria. A detailed description the saving behavior through time provided. The α-maximin also considered, optimal solution characterized.

We present a theoretical basis for testing related endpoints. Typically, it is known how to construct tests of the individual hypotheses, and the problem is how to combine them into a multiple test procedure that controls the familywise error rate. Using the closure method, we emphasize the role of consonant procedures, from an interpretive as well as a theoretical viewpoint, and introduce a ne...