Rational Capability in Concurrent Games
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910834256510976 |
|---|---|
| author | Li, Yinfeng Lorini, Emiliano Mittelmann, Munyque |
| author_facet | Li, Yinfeng Lorini, Emiliano Mittelmann, Munyque |
| contents | We extend concurrent game structures (CGSs) with a simple notion of preference over computations and define a minimal notion of rationality for agents based on the concept of dominance. We use this notion to interpret a CL and an ATL languages that extend the basic CL and ATL languages with modalities for rational capability, namely, a coalition's capability to rationally enforce a given property. For each of these languages, we provide results about the complexity of satisfiability checking and model checking as well as about axiomatization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_12286 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Rational Capability in Concurrent Games Li, Yinfeng Lorini, Emiliano Mittelmann, Munyque Logic in Computer Science Multiagent Systems We extend concurrent game structures (CGSs) with a simple notion of preference over computations and define a minimal notion of rationality for agents based on the concept of dominance. We use this notion to interpret a CL and an ATL languages that extend the basic CL and ATL languages with modalities for rational capability, namely, a coalition's capability to rationally enforce a given property. For each of these languages, we provide results about the complexity of satisfiability checking and model checking as well as about axiomatization. |
| title | Rational Capability in Concurrent Games |
| topic | Logic in Computer Science Multiagent Systems |
| url | https://arxiv.org/abs/2502.12286 |