Pages that link to "Item:Q5388151"
From MaRDI portal
The following pages link to On the complexity of problems on simple games (Q5388151):
Displaying 36 items.
- Computational complexity in the design of voting rules (Q256771) (← links)
- On the complexity of exchanging (Q264207) (← links)
- Mathematical structures of simple voting games (Q459164) (← links)
- Dimension and codimension of simple games (Q510973) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- Games with winning conditions of high Borel complexity (Q817850) (← links)
- Influence decision models: from cooperative game theory to social network analysis (Q826316) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- NP-completeness of some problems concerning voting games (Q918448) (← links)
- Complete simple games (Q1278570) (← links)
- Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← links)
- Complexity of path discovery game problems (Q1566737) (← links)
- On the characterization of weighted simple games (Q1698978) (← links)
- Nonanonymity and sensitivity of computable simple games (Q1763192) (← links)
- The fundamental theorem of voting schemes (Q1906123) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Three hierarchies of simple games parameterized by ``resource'' parameters (Q1939511) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- Winning coalitions in plurality voting democracies (Q2235088) (← links)
- Simple complexity from imitation games (Q2268119) (← links)
- On the structure of minimal winning coalitions in simple voting games (Q2268893) (← links)
- Amplitude of weighted representation of voting games with several levels of approval (Q2280045) (← links)
- On Dedekind's problem for complete simple games (Q2376066) (← links)
- Lexicographic composition of simple games (Q2427133) (← links)
- On the dimension of simple monotonic games (Q2572841) (← links)
- Cooperation through social influence (Q2630248) (← links)
- On the complexity of the decisive problem in simple and weighted games (Q2840677) (← links)
- ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES (Q3021974) (← links)
- On the Complexity of n-Player Hackenbush (Q3400102) (← links)
- Domino Games and Complexity (Q3495644) (← links)
- The Game of n-Player Shove and Its Complexity (Q5392650) (← links)
- Automata, Languages and Programming (Q5466545) (← links)
- The complexity of recursion theoretic games (Q5694972) (← links)
- Multidimension: a dimensionality extension of simple games (Q6060715) (← links)
- On the generalized dimension and codimension of simple games (Q6106512) (← links)
- Social disruption games in signed networks (Q6199710) (← links)
