On link deletion and point deletion in games on graphs
Sujata Ghosh, Shreyas Gupta, Lei Li

TL;DR
This paper analyzes link and point deletion operators in graph games, focusing on bisimulation invariance, through logical and algorithmic methods to understand their formal relationship.
Contribution
It provides a formal comparison of link and point deletion operators in graph games using logical and algorithmic approaches, emphasizing bisimulation invariance.
Findings
Both logical and algorithmic analyses of deletion operators
Insights into bisimulation invariance in graph games
Formal connection between link and point deletion operators
Abstract
We discuss link and point deletion operators on graph games and provide a comparative logic-algorithmic study of the same. In particular, we focus on a popular notion of invariance in transition systems, namely, bisimulation, between the respective games on graphs. We present both logical and algorithmic analyses of the concepts so as to provide a more formal analysis of the natural connection between these two operators.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Game Theory and Applications · Logic, Reasoning, and Knowledge
