Imagen de Portada

Computing Threshold Budgets in Discrete-Bidding Games

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Avni, Guy, Sadhukhan, Suman
Formato:	Preprint
Publicado:	2022
Materias:	Formal Languages and Automata Theory Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Mean-payoff and Energy Discrete Bidding Games
por: Avni, Guy, et al.
Publicado: (2025)

Auction-Based Scheduling
por: Avni, Guy, et al.
Publicado: (2023)

Faster and Smaller Solutions of Obliging Games
por: Hausmann, Daniel, et al.
Publicado: (2024)

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata
por: Fernau, Henning, et al.
Publicado: (2024)

An Automata-Based Approach to Games with $ω$-Automatic Preferences
por: Bruyère, Véronique, et al.
Publicado: (2026)

Complexity of the Existence of Constrained Secure Equilibria in Multi-Player Games
por: Mizuno, Hiroki, et al.
Publicado: (2025)

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

Games on Graphs: From Logic and Automata to Algorithms
por: Fijalkow, Nathanaël, et al.
Publicado: (2023)

Playing Safe, Ten Years Later
por: Colcombet, Thomas, et al.
Publicado: (2022)

Non-cooperative rational synthesis problem for probabilistic strategies
por: Koide, So, et al.
Publicado: (2024)

Distributed Fair Assignment and Rebalancing for Mobility-on-Demand Systems via an Auction-based Method
por: Liang, Kaier, et al.
Publicado: (2024)

The Power of Counting Steps in Quantitative Games
por: Bose, Sougata, et al.
Publicado: (2024)

Equilibria in Multiplayer Graph Games: An Algorithmic Study
por: Brice, Léonard
Publicado: (2026)

Arena-Independent Finite-Memory Determinacy in Stochastic Games
por: Bouyer, Patricia, et al.
Publicado: (2021)

Admissibility Over Winning: A New Approach to Reactive Synthesis in Robotics
por: Muvvala, Karan, et al.
Publicado: (2024)

Decoupled Planning for Multiple Omega-Regular Objectives
por: Avni, Guy, et al.
Publicado: (2026)

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

Different Strokes in Randomised Strategies: Revisiting Kuhn's Theorem under Finite-Memory Assumptions
por: Main, James C. A., et al.
Publicado: (2022)

Reasoning about Strategic Abilities in Stochastic Multi-agent Systems
por: Zhang, Yedi, et al.
Publicado: (2024)

On the Existence of Reactive Strategies Resilient to Delay
por: Fränzle, Martin, et al.
Publicado: (2023)

Randomise Alone, Reach as a Team
por: Brice, Léonard, et al.
Publicado: (2026)

Hypergame Rationalisability: Solving Agent Misalignment In Strategic Play
por: Trencsenyi, Vince
Publicado: (2025)

Reach together: How populations win repeated games
por: Bertrand, Nathalie, et al.
Publicado: (2025)

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games
por: Bhaduri, Purandar
Publicado: (2025)

A positional $\mathbfΠ^0_3$-complete objective
por: Casares, Antonio, et al.
Publicado: (2024)

Attractors Is All You Need: Parity Games In Polynomial Time
por: van der Heijden, Rick
Publicado: (2025)

Taming Infinity one Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs
por: Ajdarów, Michal, et al.
Publicado: (2025)

Mixing Any Cocktail with Limited Ingredients: On the Structure of Payoff Sets in Multi-Objective POMDPs and its Impact on Randomised Strategies
por: Main, James C. A., et al.
Publicado: (2025)

Discounted-Sum Automata with Multiple Discount Factors
por: Boker, Udi, et al.
Publicado: (2023)

Parity Games on Temporal Graphs
por: Austin, Pete, et al.
Publicado: (2023)

Determinization of Min-Plus Weighted Automata is Decidable
por: Almagor, Shaull, et al.
Publicado: (2025)

Adversarial Synchronization
por: Lipin, Anton E., et al.
Publicado: (2026)

Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond $\forall^*\exists^*$
por: Winter, Sarah, et al.
Publicado: (2025)

Synthesis of Computable Regular Functions of Infinite Words
por: Dave, V., et al.
Publicado: (2019)

Synthesizing Computable Functions from Rational Specifications over Infinite Words
por: Filiot, Emmanuel, et al.
Publicado: (2021)

Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
por: Winter, Sarah, et al.
Publicado: (2024)

Controller Synthesis for Parametric Timed Games
por: Dahlsen-Jensen, Mikael Bisgaard, et al.
Publicado: (2025)

Unambiguisability and Register Minimisation of Min-Plus Models
por: Almagor, Shaull, et al.
Publicado: (2025)

A Complexity Bound for Determinisation of Min-Plus Weighted Automata
por: Almagor, Shaull, et al.
Publicado: (2026)

More on Maximally Permissive Similarity Control of Discrete Event Systems
por: Wang, Yu, et al.
Publicado: (2024)