Pages that link to "Item:Q2268913"
From MaRDI portal
The following pages link to On the computational complexity of weighted voting games (Q2268913):
Displaying 47 items.
- Proof systems and transformation games (Q354613) (← links)
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum (Q490225) (← links)
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- Reasoning about coalitional games (Q834401) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- NP-completeness of some problems concerning voting games (Q918448) (← links)
- Strategy-proofness and weighted voting (Q991312) (← links)
- On the existence of a minimum integer representation for weighted voting systems (Q1026570) (← links)
- Resource based cooperative games: optimization, fairness and stability (Q1617670) (← links)
- Growth of dimension in complete simple games (Q1680089) (← links)
- Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
- Analyzing power in weighted voting games with super-increasing weights (Q1733386) (← links)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- Average weights and power in weighted voting games (Q2019323) (← links)
- Negotiating team formation using deep reinforcement learning (Q2046007) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games (Q2070558) (← links)
- Computing the nucleolus of weighted voting games in pseudo-polynomial time (Q2089798) (← links)
- Monte Carlo methods for the Shapley-Shubik power index (Q2091694) (← links)
- Measuring power in coalitional games with friends, enemies and allies (Q2093400) (← links)
- Finding and verifying the nucleolus of cooperative games (Q2235144) (← links)
- On the computational complexity of weighted voting games (Q2268913) (← links)
- Cooperative games with overlapping coalitions: charting the tractability frontier (Q2321289) (← links)
- A linear approximation method for the Shapley value (Q2389675) (← links)
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability (Q2409675) (← links)
- Characteristic function games with restricted agent interactions: core-stability and coalition structures (Q2634475) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- Analyzing Power in Weighted Voting Games with Super-Increasing Weights (Q2819457) (← links)
- The complexity of the nucleolus in compact games (Q2828226) (← links)
- Reliability Weighted Voting Games (Q2856130) (← links)
- (Q2939696) (← links)
- The Cost of Stability in Network Flow Games (Q3182962) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
- A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications (Q3392305) (← links)
- (Q4999041) (← links)
- Asymptotically optimal election on weighted rings (Q5054762) (← links)
- Weighted Voting Games (Q5133019) (← links)
- On the complexity of problems on simple games (Q5388151) (← links)
- False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time (Q5405028) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
- Complexity of computing the Shapley value in partition function form games (Q6488801) (← links)