We prove that a stationary max–infinitely divisible process is mixing (ergodic) iff its dependence function converges to 0 (is Cesaro summable to 0). These criteria are applied to some classes of max–infinitely divisible processes.

This paper studies supermodular mechanism design in environments with finite type spaces and interdependent valuations. In such environments, it is difficult to implement social choice functions in ex-post equilibrium, hence Bayesian Nash equilibrium becomes the appropriate equilibrium concept. The requirements for agents to play a Bayesian equilibrium are strong, so we propose mechanisms that ...

Abstract We study a strict version of the notion equilibrium robustness by Kajii and Morris (Econometrica 65:1283–1309, 1997) that allows for larger class incomplete information perturbations given complete game, where with high probability, players believe their payoffs are close to (but may be different from) those game. show monotone potential maximizer game is strictly robust if either or a...

The supermodular covering knapsack set is the discrete upper level set of a non-decreasing supermodular function. Submodular and supermodular knapsack sets arise naturally when modeling utilities, risk and probabilistic constraints on discrete variables. In a recent paper Atamtürk and Narayanan [6] study the lower level set of a non-decreasing submodular function. In this complementary paper we...

Generalized notions of potential maximizer, monotone potential maximizer (MP-maximizer) and local potential maximizer (LPmaximizer), are studied. It is known that 2 × 2 coordination games generically have a potential maximizer, while symmetric 4 × 4 supermodular games may have no MPor LP-maximizer. This note considers the case inbetween, namely the class of (generic) symmetric 3 × 3 supermodula...

The supermodular covering knapsack set is the discrete upper level set of a non-decreasing supermodular function. Submodular and supermodular knapsack sets arise naturally when modeling utilities, risk and probabilistic constraints on discrete variables. In a recent paper Atamtürk and Narayanan [6] study the lower level set of a non-decreasing submodular function. In this complementary paper we...