Journal article

On the computational complexity of weighted voting games

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Elkind, E., Goldberg, L., Goldberg, P., & Wooldridge, M. (2009). On the computational complexity of weighted voting games. Ann. Math. Artif. Intell., 56(2), 109–131.

MLA Style

Elkind, E., et al. “On the Computational Complexity of Weighted Voting Games.” Ann. Math. Artif. Intell., vol. 56, no. 2, 2009, pp. 109–31.

Chicago Style

Elkind, E, L Goldberg, P Goldberg, and M Wooldridge. 2009. “On the Computational Complexity of Weighted Voting Games.” Ann. Math. Artif. Intell. 56 (2): 109–31.
Share
Print

Authors

+ Elkind, E More by this author

Role:: Author

+ Goldberg, L More by this author

Role:: Author

+ Goldberg, P More by this author

Role:: Author

+ Wooldridge, M More by this author

Role:: Author

Journal:: Ann. Math. Artif. Intell. More from this journal
Volume:: 56
Issue:: 2
Pages:: 109-131
Publication date:: 2009-01-01

UUID:: uuid:5d0a0aa0-8d51-4c83-acc0-1aabeba644a7
Local pid:: cs:7615
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2009

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP