NP-completeness of some problems concerning voting games-Reference-Cited by-同舟云学术

NP-completeness of some problems concerning voting games

Published:1990-03 Issue:1 Volume:19 Page:1-9
ISSN:0020-7276
Container-title:International Journal of Game Theory
language:en
Short-container-title:Int J Game Theory

Author:

Prasad K.,Kelly J. S.

Publisher

Springer Science and Business Media LLC

Subject

Statistics, Probability and Uncertainty,Economics and Econometrics,Social Sciences (miscellaneous),Mathematics (miscellaneous),Statistics and Probability

Link

http://link.springer.com/content/pdf/10.1007/BF01753703.pdf

Reference4 articles.

1. Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co.

2. Luce RD, Raiffa H (1957) Games and Decisions. Wiley

3. Hoffmann AJ, Wolfe P (1985) History. Chapter 1 in Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The Traveling Salesman Problem. Wiley

4. Valiant LG (1979) The Complexity of Computing the Permanent. Theoretical Computer Science, 8, 189–201

Cited by 45 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum Algorithms for Shapley Value Calculation;2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023-09-17

2. Monte Carlo Methods for the Shapley–Shubik Power Index;Games;2022-06-02

3. Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games;Mathematical Social Sciences;2022-01

4. Responsibility and verification: Importance value in temporal logics;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

5. Voting power on a graph connected political space with an application to decision-making in the Council of the European Union;Social Choice and Welfare;2021-05-06