Most General Winning Secure Equilibria Synthesis in Graph Games

Nayak, Satya Prakash; Schmuck, Anne-Kathrin

doi:10.1007/978-3-031-57256-2_9

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Most General Winning Secure Equilibria Synthesis in Graph Games

MPS-Authors

/persons/resource/persons275112

Nayak, Satya Prakash
Group A.-K. Schmuck, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons188484

Schmuck, Anne-Kathrin
Group A.-K. Schmuck, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

978-3-031-57256-2_9.pdf
(Publisher version), 572KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Nayak, S. P., & Schmuck, A.-K. (2024). Most General Winning Secure Equilibria Synthesis in Graph Games. In B. Finkbeiner, & L. Kovács (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (pp. 173-193). Berlin: Springer. doi:10.1007/978-3-031-57256-2_9.

Cite as: https://hdl.handle.net/21.11116/0000-000F-55CA-E

Abstract

There is no abstract available