@inproceedings{68c8fb407761446b9f7d6bdabfe64484,
title = "Computing dominance-based solution concepts",
abstract = "Two common criticisms of Nash equilibrium are its dependence on very demanding epistemic assumptions and its computational intractability. We study the computational properties of less demanding set-valued solution concepts that are based on varying notions of dominance. These concepts are intuitively appealing, they always exist, and admit unique minimal solutions in important subclasses of games. Examples include Shapley's saddles, Harsanyi and Selten's primitive formations, Basu and Weibull's CURB sets, and Dutta and Laslier's minimal covering sets. We propose two generic algorithms for computing these concepts and investigate for which classes of games and which properties of the underlying dominance notion the algorithms are sound and efficient.",
keywords = "curb sets, game theory, shapley's saddles, solution concepts",
author = "Felix Brandt and Markus Brill",
year = "2012",
doi = "10.1145/2229012.2229032",
language = "English",
isbn = "9781450314152",
series = "Proceedings of the ACM Conference on Electronic Commerce",
pages = "233",
booktitle = "EC '12 - Proceedings of the 13th ACM Conference on Electronic Commerce",
note = "13th ACM Conference on Electronic Commerce, EC '12 ; Conference date: 04-06-2012 Through 08-06-2012",
}