We present an axiomatization of expected utility from the frequentist perspective. It starts with a preference relation on the set of infinite sequences with limit relative frequencies. We consider three axioms parallel to the ones for the von Neumann–Morgenstern (vN–M) expected utility...

Unpredictable behavior is central to optimal play in many strategic situations because predictable patterns leave players vulnerable to exploitation. A theory of unpredictable behavior based on differential complexity constraints is presented in the context of repeated two-person zero-sum games....

Contested Pile methods are two-phase procedures for the fair allocation of indivisible items to two players. In the Generation Phase, items over which the players’ preferences differ widely enough are allocated. “Contested” items are placed in the Contested Pile, which is then allocated in...

We consider the problem of fairly dividing <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$l$$</EquationSource> </InlineEquation> divisible goods among <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$n$$</EquationSource> </InlineEquation> agents with the generalized Leontief preferences. We propose and characterize the class of generalized egalitarian rules which satisfy efficiency, group strategy-proofness, anonymity, resource monotonicity,...</equationsource></inlineequation></equationsource></inlineequation>

This paper considers cost sharing rules for the continuous knapsack problem. We assume a knapsack with a weight constraint to be filled with items of different weights chosen from a set of items. The cost of the knapsack needs to be shared among the individuals who approve or disapprove of...

The European Parliament is one of the most important institutions of the European Union. One of its main tasks is to represent the citizens of the European Union. The representation power of a state depends on its population. Unfortunately the number of inhabitants of states is distinguished by...

Assume that two players have strict rankings over an even number of indivisible items. We propose algorithms to find allocations of these items that are maximin—maximize the minimum rank of the items that the players receive—and are envy-free and Pareto-optimal if such allocations exist. We...