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.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Proposes SVD-based reduction of multi-dimensional matching to 1D problem for O(N log N) computation that approximates Nash Social Welfare under low effective dimensionality.
A systematic mapping study of Karma mechanisms that compares applications, structures design parameters, and maps future research directions in non-monetary resource allocation.
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.
-
Multi-Dimensional Matching in Market Design
Proposes SVD-based reduction of multi-dimensional matching to 1D problem for O(N log N) computation that approximates Nash Social Welfare under low effective dimensionality.
-
Resource Allocation with Karma Mechanisms
A systematic mapping study of Karma mechanisms that compares applications, structures design parameters, and maps future research directions in non-monetary resource allocation.