Pages that link to "Item:Q1101310"

The following pages link to Social choice and computational complexity (Q1101310):

Displaying 19 items.

• Computational complexity in the design of voting rules (Q256771) (← links)
• Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
• Social choice and individual values in the electronic republic (Q649143) (← links)
• On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem (Q1022421) (← links)
• The Nakamura numbers for computable simple games (Q1038709) (← links)
• Computability and randomness of Nash equilibrium in infinite games (Q1177225) (← links)
• Nonanonymity and sensitivity of computable simple games (Q1763192) (← links)
• On the difficulty of making social choices (Q1891667) (← links)
• Arrow's theorem, countably many agents, and more visible invisible dictators (Q1961954) (← links)
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
• Algorithms, approximation, and empirical studies in behavioral and computational social choice -- preface (Q2436694) (← links)
• Developing the aggregate empirical side of computational social choice (Q2436696) (← links)
• On the computability of binary social choice rules in an infinite society and the halting problem (Q2479229) (← links)
• Computability of simple games: A characterization and application to the core (Q2482640) (← links)
• (Q3730298) (← links)
• Introduction to Computational Social Choice (Q5133004) (← links)
• Social choice among complex objects (Q5246462) (← links)
• A Short Introduction to Computational Social Choice (Q5448765) (← links)
• Reduction theorems in the social choice theory (Q6174465) (← links)