Pages that link to "Item:Q2089798"
From MaRDI portal
The following pages link to Computing the nucleolus of weighted voting games in pseudo-polynomial time (Q2089798):
Displaying 5 items.
- A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure (Q637584) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games (Q2070558) (← links)
- On the computational complexity of weighted voting games (Q2268913) (← links)
- False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time (Q5405028) (← links)