Pages that link to "Item:Q3081450"
From MaRDI portal
The following pages link to Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects (Q3081450):
Displayed 19 items.
- First-order logic formalisation of impossibility theorems in preference aggregation (Q373021) (← links)
- Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs (Q420790) (← links)
- Automated reasoning in social choice theory: some remarks (Q475377) (← links)
- An introduction to mechanized reasoning (Q504394) (← links)
- A graphical study of comparative probabilities (Q825132) (← links)
- Possibilistic reasoning with partially ordered beliefs (Q893599) (← links)
- Iterative voting and acyclic games (Q1677436) (← links)
- Optimal bounds for the no-show paradox via SAT solving (Q1680092) (← links)
- Sincerity and manipulation under approval voting (Q1945667) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Ranking sets of interacting objects via semivalues (Q2355016) (← links)
- Min-max decision rules for choice under complete uncertainty: axiomatic characterizations for preferences over utility intervals (Q2447780) (← links)
- Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
- Applications of Logic in Social Choice Theory (Q3092295) (← links)
- (Q3384086) (← links)
- Algorithmic Decision Theory Meets Logic (Q3449186) (← links)
- Foreword (Q5891934) (← links)
- Taxonomy of powerful voters and manipulation in the framework of social choice functions (Q6051889) (← links)
- On manipulation in merging epistemic states (Q6099553) (← links)