We uncover the complete ordinal implications of supermodularity on finite lattices under the assumption of weak monotonicity. In this environment, we show that supermodularity is ordinally equivalent to the notion of quasisupermodularity introduced by Milgrom and Shannon. We conclude that supermodularity is a weak property, in the sense that many preferences have a supermodular representation.Complementarity Revealed preference Afriat's theorem Refutability
This paper proves that every preference relation over the set of all menus from a finite set has an ...
In lattice theory the two well known equational class of lattices are the distributive lattices and ...
This work presents a systematic study of the preservation of supermodularity under parametric optimi...
Supermodularity of utility has long been understood as capturing the notion of complementarities in ...
We uncover the complete ordinal implications of supermodularity on finite lattices under the assumpt...
International audienceChambers and Echenique (J Econ Theory 144:1004–1014, 2009) proved that prefere...
We study the ordinal content of assuming supermodularity, including conditions under which a binary ...
Supermodularity has long been regarded as a natural notion of complementarities in individual decisi...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
Let a preference ordering on a lattice be perturbed. As is well known, single crossing conditions ar...
We consider several ordinal formulations of submodularity, defined for arbitrary binary relations on...
This paper studies preferences over menus of alternatives. A preference is monotonic when every menu...
Abstract. We study strategic games where players ’ preferences are weak orders which need not admit ...
If a preference ordering on a complete lattice is quasisupermodular, or just satisfies a rather wea...
This paper proves that every preference relation over the set of all menus from a finite set has an ...
In lattice theory the two well known equational class of lattices are the distributive lattices and ...
This work presents a systematic study of the preservation of supermodularity under parametric optimi...
Supermodularity of utility has long been understood as capturing the notion of complementarities in ...
We uncover the complete ordinal implications of supermodularity on finite lattices under the assumpt...
International audienceChambers and Echenique (J Econ Theory 144:1004–1014, 2009) proved that prefere...
We study the ordinal content of assuming supermodularity, including conditions under which a binary ...
Supermodularity has long been regarded as a natural notion of complementarities in individual decisi...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
Let a preference ordering on a lattice be perturbed. As is well known, single crossing conditions ar...
We consider several ordinal formulations of submodularity, defined for arbitrary binary relations on...
This paper studies preferences over menus of alternatives. A preference is monotonic when every menu...
Abstract. We study strategic games where players ’ preferences are weak orders which need not admit ...
If a preference ordering on a complete lattice is quasisupermodular, or just satisfies a rather wea...
This paper proves that every preference relation over the set of all menus from a finite set has an ...
In lattice theory the two well known equational class of lattices are the distributive lattices and ...
This work presents a systematic study of the preservation of supermodularity under parametric optimi...