Centralized matching mechanisms outperform free negotiation in stability and efficiency with LLM agents, who also report preferences truthfully more often than humans, though not always in line with strategy-proofness predictions.
On cores and indivisibility
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.GT 3verdicts
UNVERDICTED 3representative citing papers
Establishes conditional PPAD-hardness of approximate HZ equilibria via PCP-for-PPAD and unconditional hardness for restricted ε-HZ equilibria.
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.
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.