✦ LIBER ✦

The computational complexity of rationalizing Pareto optimal choice behavior

✍ Scribed by Thomas Demuynck

Book ID: 120785805
Publisher: Springer
Year: 2013
Tongue: English
Weight: 357 KB
Volume: 42
Category: Article
ISSN: 0176-1714
DOI: 10.1007/s00355-013-0735-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The computational complexity of rational

The computational complexity of rationalizing boundedly rational choice behavior

✍ Thomas Demuynck 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 331 KB

The Computational Complexity of Choice S

The Computational Complexity of Choice Sets

✍ Felix Brandt; Felix Fischer; Paul Harrenstein 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract Social choice rules are often evaluated and compared by inquiring whether they satisfy certain desirable criteria such as the __Condorcet criterion__, which states that an alternative should always be chosen when more than half of the voters prefer it over any other alternative. Many of

On the Complexity of Pareto-Optimal Nash

On the Complexity of Pareto-Optimal Nash and Strong Equilibria

✍ Hoefer, Martin; Skopalik, Alexander 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 481 KB

On the Evolution of Pareto-Optimal Behav

On the Evolution of Pareto-Optimal Behavior in Repeated Coordination Problems

✍ Roger Lagunoff 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

Single-exception sorting networks and th

Single-exception sorting networks and the computational complexity of optimal sorting network verification

✍ Ian Parberry 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 775 KB

International Encyclopedia of the Social

International Encyclopedia of the Social & Behavioral Sciences || Rational Choice and Organization Theory

✍ Zey, M. 📂 Article 📅 2001 🏛 Elsevier ⚖ 68 KB