RECORD
Relaxing Exclusive Control in Boolean Games
Artificial Intelligence · Submitted 27 Jul 2017
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Our main result shows that, as far as verification is concerned, CGS-SPC can be reduced to concurrent game structures with exclusive control.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
In the typical framework for boolean games (BG) each player can change the truth value of some propositional atoms, while attempting to make her goal true. In standard BG goals are propositional formulas, whereas in iterated BG goals are formulas of Linear Temporal Logic. Both notions of BG are characterised by the fact that agents have exclusive control over their set of atoms, meaning that no two agents can control the same atom. In the present contribution we drop the exclusivity assumption and explore structures where an atom can be controlled by multiple agents. We introduce Concurrent Game Structures with Shared Propositional Control (CGS-SPC) and show that they ac- count for several classes of repeated games, including iterated boolean games, influence games, and aggregation games. Our main result shows that, as far as verification is concerned, CGS-SPC can be reduced to concurrent game structures with exclusive control. This result provides a polynomial reduction for the model checking problem of specifications in Alternating-time Temporal Logic on CGS-SPC.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | In the typical framework for boolean games (BG) each player can change the truth value of some propositional atoms, while attempting to make her goal true. | background 1.00 | 0.04 | 0.01 | asserted 1.00 |
| s1 | In standard BG goals are propositional formulas, whereas in iterated BG goals are formulas of Linear Temporal Logic. | background 1.00 | 0.05 | 0.02 | asserted 1.00 |
| s2 | Both notions of BG are characterised by the fact that agents have exclusive control over their set of atoms, meaning that no two agents can control the same atom. | background 1.00 | 0.08 | 0.02 | asserted 1.00 |
| s3 | In the present contribution we drop the exclusivity assumption and explore structures where an atom can be controlled by multiple agents. | contribution 0.99 | 0.87 | 0.05 | asserted 0.97 |
| s4 | We introduce Concurrent Game Structures with Shared Propositional Control (CGS-SPC) and show that they ac- count for several classes of repeated games, including iterated boolean games, influence games, and aggregation games. | contribution 0.91 | 0.94 | 0.06 | asserted 1.00 |
| s5 | Our main result shows that, as far as verification is concerned, CGS-SPC can be reduced to concurrent game structures with exclusive control. | result 1.00 | 0.94 | 0.96 | asserted 1.00 |
| s6 | This result provides a polynomial reduction for the model checking problem of specifications in Alternating-time Temporal Logic on CGS-SPC. | interpretation 0.59 | 0.90 | 0.13 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
In the typical framework for boolean games (BG) each player can change the truth value of some propositional atoms, while attempting to make her goal true. In standard BG goals are propositional formulas, whereas in iterated BG goals are formulas of Linear Temporal Logic. Both notions of BG are characterised by the fact that agents have exclusive control over their set of atoms, meaning that no two agents can control the same atom. In the present contribution we drop the exclusivity assumption and explore structures where an atom can be controlled by multiple agents. We introduce Concurrent Game Structures with Shared Propositional Control (CGS-SPC) and show that they ac- count for several classes of repeated games, including iterated boolean games, influence games, and aggregation games. Our main result shows that, as far as verification is concerned, CGS-SPC can be reduced to concurrent game structures with exclusive control. This result provides a polynomial reduction for the model checking problem of specifications in Alternating-time Temporal Logic on CGS-SPC.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.