✦ LIBER ✦

Approachability and Games on Posets

✍ Scribed by Yasuo Yoshinobu

Book ID: 124980239
Publisher: Association for Symbolic Logic
Year: 2003
Tongue: English
Weight: 356 KB
Volume: 68
Category: Article
ISSN: 0022-4812
DOI: 10.2307/4147698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Repeated Games and Qualitative Different

Repeated Games and Qualitative Differential Games: Approachability and Comparison of Strategies

✍ Soulaimani, Sami As; Quincampoix, Marc; Sorin, Sylvain 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 263 KB

Approachability in repeated games: Compu

Approachability in repeated games: Computational aspects and a Stackelberg variant

✍ Shie Mannor; John N. Tsitsiklis 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 163 KB

On the Complexity of Computing Winning S

On the Complexity of Computing Winning Strategies for Finite Poset Games

✍ Michael Soltys; Craig Wilson 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 480 KB

On Posets and Hopf Algebras

✍ Richard Ehrenborg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 810 KB

We generalize the notion of the rank-generating function of a graded poset. Namely, by enumerating different chains in a poset, we can assign a quasi-symmetric function to the poset. This map is a Hopf algebra homomorphism between the reduced incidence Hopf algebra of posets and the Hopf algebra of

On posets and independence spaces

✍ Mao, Hua 📂 Article 📅 2014 🏛 Elsevier ⚖ 377 KB

Applications of fixed point theory to ex

Applications of fixed point theory to extended Nash equilibriums of nonmonetized noncooperative games on posets

✍ Xie, Linsen; Li, Jinlu; Wen, Ching-Feng 📂 Article 📅 2013 🏛 Springer International Publishing AG 🌐 English ⚖ 230 KB