IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v40y2000i2p227-235.html
   My bibliography  Save this article

Easy weighted majority games

Author

Listed:
  • Chakravarty, Nilotpal
  • Goel, Anand Mohan
  • Sastry, Trilochan

Abstract

No abstract is available for this item.

Suggested Citation

  • Chakravarty, Nilotpal & Goel, Anand Mohan & Sastry, Trilochan, 2000. "Easy weighted majority games," Mathematical Social Sciences, Elsevier, vol. 40(2), pages 227-235, September.
    • Handle: RePEc:eee:matsoc:v:40:y:2000:i:2:p:227-235
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(99)00050-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Prasad, K & Kelly, J S, 1990. "NP-Completeness of Some Problems Concerning Voting Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 19(1), pages 1-9.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Martí Jané Ballarín, 2023. "The complexity of power indices in voting games with incompatible players," UB School of Economics Working Papers 2023/441, University of Barcelona School of Economics.
    2. Ghosh, D. & Chakravarti, N. & Sierksma, G., 2000. "Sensitivity analysis of the greedy heuristic for binary knapsack problems," Research Report 00A18, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    3. Berghammer, Rudolf & Bolus, Stefan, 2012. "On the use of binary decision diagrams for solving problems on simple games," European Journal of Operational Research, Elsevier, vol. 222(3), pages 529-541.
    4. Benati, Stefano & Rizzi, Romeo & Tovey, Craig, 2015. "The complexity of power indexes with graph restricted coalitions," Mathematical Social Sciences, Elsevier, vol. 76(C), pages 53-63.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Martí Jané Ballarín, 2023. "The complexity of power indices in voting games with incompatible players," UB School of Economics Working Papers 2023/441, University of Barcelona School of Economics.
    2. Yuto Ushioda & Masato Tanaka & Tomomi Matsui, 2022. "Monte Carlo Methods for the Shapley–Shubik Power Index," Games, MDPI, vol. 13(3), pages 1-14, June.
    3. Benati, Stefano & Rizzi, Romeo & Tovey, Craig, 2015. "The complexity of power indexes with graph restricted coalitions," Mathematical Social Sciences, Elsevier, vol. 76(C), pages 53-63.
    4. Stefano Benati & Giuseppe Vittucci Marzetti, 2021. "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, Springer;The Society for Social Choice and Welfare, vol. 57(4), pages 733-761, November.
    5. Pavel Doležel, 2011. "Optimizing the Efficiency of Weighted Voting Games," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 5(3), pages 306-323, November.
    6. Dowell, Andrew J. & Wooldridge, Michael & McBurney, Peter, 2007. "The Computational Difficulty of Bribery in Qualitative Coalitional Games," Coalition Theory Network Working Papers 7444, Fondazione Eni Enrico Mattei (FEEM).
    7. Berghammer, Rudolf & Bolus, Stefan & Rusinowska, Agnieszka & de Swart, Harrie, 2011. "A relation-algebraic approach to simple games," European Journal of Operational Research, Elsevier, vol. 210(1), pages 68-80, April.
    8. Tanaka, Masato & Matsui, Tomomi, 2022. "Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games," Mathematical Social Sciences, Elsevier, vol. 115(C), pages 47-51.
    9. Le Breton, Michel & Thomas, Alban & Zaporozhets, Vera, 2012. "Bargaining in River Basin Committees: Rules Versus Discretion," LERNA Working Papers 12.12.369, LERNA, University of Toulouse.
    10. Ben Hermans & Herbert Hamers & Roel Leus & Roy Lindelauf, 2019. "Timely exposure of a secret project: Which activities to monitor?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(6), pages 451-468, September.
    11. Rudolf Berghammer & Agnieszka Rusinowska & Harrie de Swart, 2011. "Computations on Simple Games using REL VIEW," Post-Print halshs-00587690, HAL.
    12. Klinz, Bettina & Woeginger, Gerhard J., 2005. "Faster algorithms for computing power indices in weighted voting games," Mathematical Social Sciences, Elsevier, vol. 49(1), pages 111-116, January.
    13. Berghammer, Rudolf & Bolus, Stefan, 2012. "On the use of binary decision diagrams for solving problems on simple games," European Journal of Operational Research, Elsevier, vol. 222(3), pages 529-541.
    14. de Keijzer, B. & Klos, T.B. & Zhang, Y., 2012. "Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration," ERIM Report Series Research in Management ERS-2012-006-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    15. Konstantin Avrachenkov & Laura Cottatellucci & Lorenzo Maggi, 2014. "Confidence Intervals for the Shapley–Shubik Power Index in Markovian Games," Dynamic Games and Applications, Springer, vol. 4(1), pages 10-31, March.
    16. Andrew Dowell & Michael Wooldridge & Peter McBurney, 2007. "The Computational Difficulty of Bribery in Qualitative Coalitional Games," Working Papers 2007.100, Fondazione Eni Enrico Mattei.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:40:y:2000:i:2:p:227-235. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.