DeepAI AI Chat
Log In Sign Up

Reasoning about Social Choice and Games in Monadic Fixed-Point Logic

07/22/2019
by   Ramit Das, et al.
The Institute of Mathematical Sciences, Chennai
Indian Institute of Technology Kanpur
0

Whether it be in normal form games, or in fair allocations, or in voter preferences in voting systems, a certain pattern of reasoning is common. From a particular profile, an agent or a group of agents may have an incentive to shift to a new one. This induces a natural graph structure that we call the improvement graph on the strategy space of these systems. We suggest that the monadic fixed-point logic with counting, an extension of monadic first-order logic on graphs with fixed-point and counting quantifiers, is a natural specification language on improvement graphs, and thus for a class of properties that can be interpreted across these domains. The logic has an efficient model checking algorithm (in the size of the improvement graph).

READ FULL TEXT
02/28/2018

Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs

We show that the class of chordal claw-free graphs admits LREC=-definabl...
04/09/2021

Inapproximability of Unique Games in Fixed-Point Logic with Counting

We study the extent to which it is possible to approximate the optimal v...
10/14/2022

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting

At the core of the quest for a logic for PTime is a mismatch between alg...
10/17/2019

Generalized Absorptive Polynomials and Provenance Semantics for Fixed-Point Logic

Semiring provenance is a successful approach to provide detailed informa...
04/25/2023

Simulating Logspace-Recursion with Logarithmic Quantifier Depth

The fixed-point logic LREC= was developed by Grohe et al. (CSL 2011) in ...
05/05/2011

Interpreting Graph Cuts as a Max-Product Algorithm

The maximum a posteriori (MAP) configuration of binary variable models w...
04/20/2021

On link deletion and point deletion in games on graphs

We discuss link and point deletion operators on graph games and provide ...