Pages that link to "Item:Q2482640"
From MaRDI portal
The following pages link to Computability of simple games: A characterization and application to the core (Q2482640):
Displaying 14 items.
- Computational complexity in the design of voting rules (Q256771) (← links)
- Preference aggregation theory without acyclicity: the core without majority dissatisfaction (Q536092) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- A relation-algebraic approach to simple games (Q631101) (← links)
- Computing the cores of strategic games with punishment-dominance relations (Q933749) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Cores and capacities of compound simple games (Q1098789) (← links)
- Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← links)
- Nonanonymity and sensitivity of computable simple games (Q1763192) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- On Dedekind's problem for complete simple games (Q2376066) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
- On the complexity of problems on simple games (Q5388151) (← links)
- The reciprocity set (Q6559458) (← links)