Computing the nucleolus of weighted voting games
Weighted voting games (WVG) are coalitional games in which an agent’s contribution to a coalition is given by his weight, and a coalition wins if its total weight meets or exceeds a given quota. These games model decision-making in political bodies as well as collaboration and surplus division in mu...
Saved in:
Main Authors: | Pasechnik, Dmitrii V., Elkind, Edith |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/93815 http://hdl.handle.net/10220/6783 http://siam.org/proceedings/soda/2009/soda09.php |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Polynomial-time computing over quadratic maps I : sampling in real algebraic sets
by: Grigoriev, Dima., et al.
Published: (2011) -
Approximation of the stability number of a graph via copositive programming
by: Klerk, Etienne de., et al.
Published: (2011) -
On the irreducibility of a truncated binomial expansion
by: Filaseta, Michael., et al.
Published: (2011) -
A characterization of the Petersen-type geometry of the McLaughlin group
by: Baumeister, Barbara, et al.
Published: (2011) -
Subsets close to invariant subsets for group actions
by: Brailovsky, Leonid., et al.
Published: (2011)