A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Online ascending auctions for gradually expiring items
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of Kemeny elections
Theoretical Computer Science
The computational complexity of choice sets
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Algorithms for rationalizability and CURB sets
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Improved bounds for computing Kemeny rankings
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A computational analysis of the tournament equilibrium set
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
PageRank as a weak tournament solution
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Cloning in elections: finding the possible winners
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Various problems in AI and multi agent systems can be tackled by finding the "most desirable" elements of a set given some binary relation. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Some particularly attractive solution sets are defined in terms of a covering relation--a transitive subrelation of the original relation. We consider three different types of covering (upward, downward, and bidirectional) and the corresponding solution concepts known as the uncovered set and the minimal covering set. We present the first polynomial-time algorithm for finding the minimal bidirectional covering set (an acknowledged open problem) and prove that deciding whether an alternative is in a minimal upward or downward covering set is NP-hard. Furthermore, we obtain various set-theoretical inclusions, which reveal a strong connection between von Neumann-Morgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other hand. In particular, we show that every stable set is also a minimal upward covering set.