Echenique (2003)

英文ブログ[2014/5/5]より転載 

コメント 英語の記事は不人気と知りつつも、僕自身の備忘録も兼ねてときどき更新していきます。Lattice(束)の性質、特にSublattice構造は、マッチング理論などの既存命題の理解を劇的に促進してくれる便利なものですが、まだ十分に研究し尽くされていないように思います。にしても、(この論文はそれほどではありませんが)Echenique氏の研究はいずれもマニアックですね…


Echenique, F. (2003), The Equilibrium Set of a Two Player Game with Complementarities is a Sublattice, Economic Theory, 22: 903-905.  Link

Summary  I prove that the equilibrium set in a two-player game with complementarities, and totally ordered strategy spaces, is a sublattice of the joint strategy space.


It is widely known that in games with strategic complementarities (GSC), i.e., best reply correspondings are monotone increasing for all players, the set of pure-strategy Nash equilibria forms a non-empty complete lattice. This result implies the existence of smallest and largest Nash equilibria.

The current paper looks further into the structure of the equilibrium set of GSC, and shows that under certain restrictions the equilibrium set becomes not just a complete lattice but also a sublattice, as is written down in the Summary above.

The practical importance of this result, according to the author, is:

If the equilibrium set of a game is a sublattice, then we can find new equilibria from knowing that two profiles are equilibria, and by taking the componentwise join and meet of players’ strategies.

Note that we cannot obtain such strong property by a complete lattice structure alone. In this sense, a sublattice is indeed critical. The proof is extremely simple, which makes use of the observation that (a) when there are only 2 players and (b) their strategy spaces are completely ordered, (c) the other player's strategy must be completely ordered. The property (c) does not hold either (a) or (b) is not satisfied. Once (c) is verified, the rest of the proof is just to follow the definition of GSC.

My random thought: A sublattice property also arises in one-to-one two-sided matching markets (but neither in one-to-many nor many-to-many markets). I'm wondering if the idea of this paper can be somehow connected to the sublattice property of the set of stable matchings.

A final remark: A nicely written but a bit uninformative note.

この記事が気に入ったらサポートをしてみませんか?