Pages that link to "Item:Q1001906"
From MaRDI portal
The following pages link to The complexity of power-index comparison (Q1001906):
Displaying 16 items.
- Manipulating the quota in weighted voting games (Q420828) (← links)
- Confidence intervals for the Shapley-Shubik power index in Markovian games (Q471433) (← links)
- The complexity of the \(K\)th largest subset problem and related problems (Q894449) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- NP-completeness of some problems concerning voting games (Q918448) (← links)
- Analyzing power in weighted voting games with super-increasing weights (Q1733386) (← links)
- Power measures derived from the sequential query process (Q1950239) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- Controlling weighted voting games by deleting or adding players with or without changing the quota (Q2169970) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- Computing power indices: multilinear extensions and new characterizations (Q2470113) (← links)
- Comparing Computational Power (Q3424114) (← links)
- Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with an Application to False-name Manipulation (Q5154768) (← links)
- Maximum box problem on stochastic points (Q5918465) (← links)
- Power comparison for simple by characteristic polynomials (Q5959510) (← links)
- An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages (Q6630721) (← links)