Name
Abstract | ||
|---|---|---|
We introduce a logic designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We give a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We show the decidability of the logic and give a complete axiomatization. To demonstrate the value of the logic, we show in particular how it can be applied to the problem of determining whether a social choice function is strategy-proof. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1562814.1562846 | TARK |
Keywords | Field | DocType |
propositional control,agent preference,social choice function,complete axiomatization,truthful implementation,strategic ability,expected utility,modal logic,projective,query language,logic design,game theory,quantum,formal language,choice function,social choice | Discrete mathematics,Autoepistemic logic,Computer science,Zeroth-order logic,Multimodal logic,Many-valued logic,Predicate logic,Higher-order logic,Intermediate logic,Dynamic logic (modal logic) | Conference |
Citations | PageRank | References |
1 | 0.46 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Troquard | 1 | 266 | 29.54 |
| Wiebe Van Der Hoek | 2 | 2566 | 195.77 |
| Michael Wooldridge | 3 | 10010 | 810.27 |