Monadic fixed-point logic with counting is proposed as a natural specification language for properties on improvement graphs in social choice and games, with an efficient model checking algorithm whose complexity depends on graph size.
Peyton Young (1993): The evolution of conventions
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2verdicts
UNVERDICTED 2representative citing papers
Strategic agents can achieve high-harm outcomes via low-capacity channels by concentrating residual capacity on high-impact predicates of confidential data, so leakage bounds need not bound worst-case harm.
citing papers explorer
-
Reasoning about Social Choice and Games in Monadic Fixed-Point Logic
Monadic fixed-point logic with counting is proposed as a natural specification language for properties on improvement graphs in social choice and games, with an efficient model checking algorithm whose complexity depends on graph size.
-
A Note on the Strategic Confinement Problem
Strategic agents can achieve high-harm outcomes via low-capacity channels by concentrating residual capacity on high-impact predicates of confidential data, so leakage bounds need not bound worst-case harm.