Showing 1 - 8 of 8
A likelihood order is defined over linear subspaces of a finite dimensional Hilbert space. It is shown that such an order that satisfies some plausible axioms can be represented by a quantum probability in two cases: pure state and uniform measure.
Persistent link: https://www.econbiz.de/10005118658
We develop a theory of stability in many-to-many matching markets. We give conditions under which the setwise-stable set, a core-like concept, is nonempty and can be approached through an algorithm. The usual core may be empty. The setwise-stable set coincides with the pairwise-stable set, and...
Persistent link: https://www.econbiz.de/10005062394
(less than 25 lines) I prove the subgame-perfect equivalent of the basic result for Nash equilibria in normal-form games of strategic complements: the set of subgame-perfect equilibria is a non-empty, complete lattice. For this purpose I introduce a device that allows the study of the set of...
Persistent link: https://www.econbiz.de/10005407571
The literature on games of strategic complementarities (GSC) has focused on pure strategies. I introduce mixed strategies and show that, when strategy spaces are one-dimensional, the complementarities framework extends to mixed strategies ordered by first-order stochastic dominance. In...
Persistent link: https://www.econbiz.de/10005550945
I count the number of combinatorial choice rules that satisfy certain properties: Kelso-Crawford substitutability, and independence of irrelevant alternatives. The results are important for two-sided matching theory, where agents are modeled by combinatorial choice rules with these properties....
Persistent link: https://www.econbiz.de/10005118545
We study many-to-one matchings, such as the assignment of students to colleges, where the students have preferences over the other students who would attend the same college. It is well known that the core of this model may be empty, without strong assumptions on agents' preferences. We...
Persistent link: https://www.econbiz.de/10005118580
We characterize the core many-to-one matchings as fixed points of a map. Our characterization gives an algorithm for finding core allocations; the algorithm is efficient and simple to implement. Our characterization does not require substitutable preferences, so it is separate from the structure...
Persistent link: https://www.econbiz.de/10005118592
In games with strict strategic complementarities, properly mixed Nash equilibria--equilibria that are not in pure strategies--are unstable for a broad class of learning dynamics.
Persistent link: https://www.econbiz.de/10005118650