Imagen de Portada

Privacy-preserving Nash Equilibrium Synthesis with Partially Ordered Temporal Objectives

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Probine, Caleb, Kulkarni, Abhishek, Topcu, Ufuk
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Nash Equilibrium in Games on Graphs with Incomplete Preferences
por: Kulkarni, Abhishek N., et al.
Publicado: (2024)

Designing Inferable Signaling Schemes for Bayesian Persuasion
por: Probine, Caleb, et al.
Publicado: (2025)

Sequential Decision Making in Stochastic Games with Incomplete Preferences over Temporal Objectives
por: Kulkarni, Abhishek Ninad, et al.
Publicado: (2025)

Dynamic Coalitions in Games on Graphs with Preferences over Temporal Goals
por: Yilmaz, A. Kaan Ata, et al.
Publicado: (2025)

When Should Agents Coordinate in Differentiable Sequential Decision Problems?
por: Probine, Caleb, et al.
Publicado: (2026)

Temporal Explorability Games
por: Austin, Pete, et al.
Publicado: (2024)

Probabilistic Obstruction Temporal Logic: a Probabilistic Logic to Reason about Dynamic Models
por: Leneutre, Jean, et al.
Publicado: (2024)

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
por: Nayak, Satya Prakash, et al.
Publicado: (2022)

Towards the Usage of Window Counting Constraints in the Synthesis of Reactive Systems to Reduce State Space Explosion
por: Feeken, Linda, et al.
Publicado: (2024)

Discovering Expert-Level Nash Equilibrium Algorithms with Large Language Models
por: Li, Hanyu, et al.
Publicado: (2025)

Half-Positional Objectives Recognized by Deterministic Büchi Automata
por: Bouyer, Patricia, et al.
Publicado: (2022)

Designing Equilibria in Concurrent Games with Social Welfare and Temporal Logic Constraints
por: Gutierrez, Julian, et al.
Publicado: (2023)

Are Large Random Graphs Always Safe to Hide?
por: Chakraborty, Sourav, et al.
Publicado: (2025)

Seven kinds of equivalent models for generalized coalition logics
por: Chen, Zixuan, et al.
Publicado: (2025)

Games with $ω$-Automatic Preference Relations
por: Bruyère, Véronique, et al.
Publicado: (2025)

Antichains for Concurrent Parameterized Games
por: Bertrand, Nathalie, et al.
Publicado: (2025)

Polytopal Stochastic Games
por: Castro, Pablo F., et al.
Publicado: (2025)

Generalised Reachability Games Revisited
por: Bose, Sougata, et al.
Publicado: (2025)

Verifying Equilibria in Finite-Horizon Probabilistic Concurrent Game Systems
por: Rajasekaran, Senthil, et al.
Publicado: (2025)

Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games
por: Doyen, Laurent, et al.
Publicado: (2026)

Benchmarks for Parity Games (extended version)
por: Keiren, Jeroen J. A.
Publicado: (2014)

Scaling CheckMate for Game-Theoretic Security
por: Rain, Sophie, et al.
Publicado: (2024)

Regular Games with Imperfect Information Are Not That Regular
por: Doyen, Laurent, et al.
Publicado: (2024)

Faster Game Solving by Fixpoint Acceleration
por: Hausmann, Daniel
Publicado: (2024)

Concurrent Strategies on Games with Algebras
por: Huriot-Tattegrain, Sacha, et al.
Publicado: (2024)

The Complexity of Games with Randomised Control
por: Bahmani, Sarvin, et al.
Publicado: (2026)

Computational Modelling for Combinatorial Game Strategies
por: Diaconescu, Răzvan
Publicado: (2024)

More Information is Not Always Better: Connections between Zero-Sum Local Nash Equilibria in Feedback and Open-Loop Information Patterns
por: Gupta, Kushagra, et al.
Publicado: (2025)

Dynamic Coalition Structure Detection in Natural Language-based Interactions
por: Kulkarni, Abhishek N., et al.
Publicado: (2025)

Strategy Synthesis for Zero-Sum Neuro-Symbolic Concurrent Stochastic Games
por: Yan, Rui, et al.
Publicado: (2022)

Deceptive Planning Exploiting Inattention Blindness
por: Karabag, Mustafa O., et al.
Publicado: (2025)

Scalable Coordination with Chance-Constrained Correlated Equilibria via Reduced-Rank Structure
por: Im, Jaehan, et al.
Publicado: (2026)

Reinforcement Nash Equilibrium Solver
por: Wang, Xinrun, et al.
Publicado: (2024)

Completeness of coalition logics with seriality, independence of agents, or determinism
por: Li, Yinfeng, et al.
Publicado: (2024)

Memoryless Strategies in Stochastic Reachability Games
por: Kiefer, Stefan, et al.
Publicado: (2024)

BAR Nash Equilibrium and Application to Blockchain Design
por: Reynouard, Maxime, et al.
Publicado: (2024)

Privacy Guarantee for Nash Equilibrium Computation of Aggregative Games Based on Pointwise Maximal Leakage
por: Cheng, Zhaoyang, et al.
Publicado: (2025)

Spatial Branch-and-Bound for Computing Multiplayer Nash Equilibrium
por: Černý, Jakub, et al.
Publicado: (2025)

A Membrane Computing Approach to the Generalized Nash Equilibrium
por: Luque-Cerpa, Alejandro, et al.
Publicado: (2024)

Beyond Nash Equilibrium: Achieving Bayesian Perfect Equilibrium with Belief Update Fictitious Play
por: Ju, Qi, et al.
Publicado: (2024)