Name
Abstract | ||
|---|---|---|
We analyse the computational complexity of the trade robustness problem.We look at the problem of turning winning coalitions into losing coalitions.We consider the trade robustness problem for different representations.We give remaining problems related with trade robustness. We analyze the computational complexity of the problem of deciding whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j given losing coalitions into a set of j winning coalitions. We also look at the problem of turning winning coalitions into losing coalitions. We analyze the problem when the simple game is represented by a list of wining, losing, minimal winning or maximal loosing coalitions. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ipl.2016.01.004 | Information Processing Letters |
Keywords | Field | DocType |
computational complexity | Mathematical economics,Existential quantification,Robustness (computer science),Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
abs/1503.06052 | 6 | 0020-0190 |
Citations | PageRank | References |
2 | 0.38 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xavier Molinero | 1 | 133 | 15.58 |
| Martin Olsen | 2 | 74 | 11.99 |
| Maria J. Serna | 3 | 473 | 70.53 |