Copertina

Smoothed analysis of deterministic discounted and mean-payoff games

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Loff, Bruno, Skomra, Mateusz
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computer Science and Game Theory Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Smoothed Complexity of Combinatorial Local Search
di: Giannakopoulos, Yiannis, et al.
Pubblicazione: (2022)

Reducing Stochastic Games to Semidefinite Program Feasibility
di: Bodirsky, Manuel, et al.
Pubblicazione: (2024)

Non-alternating mean payoff games
di: Meyerovitch, Tom, et al.
Pubblicazione: (2025)

A symmetric recursive algorithm for mean-payoff games
di: Ohlmann, Pierre
Pubblicazione: (2026)

Cycle Patterns and Mean Payoff Games
di: Loho, Georg, et al.
Pubblicazione: (2025)

On the completeness of several fortification-interdiction games in the Polynomial Hierarchy
di: Tomasaz, Alberto Boggio, et al.
Pubblicazione: (2024)

Universal Complexity Bounds Based on Value Iteration for Stochastic Mean Payoff Games and Entropy Games
di: Allamigeon, Xavier, et al.
Pubblicazione: (2022)

A Smoothed FPTAS for Equilibria in Congestion Games
di: Giannakopoulos, Yiannis
Pubblicazione: (2023)

Precision game engineering through reshaping strategic payoffs
di: Eshoa, Elie, et al.
Pubblicazione: (2024)

Optimising expectation with guarantees for window mean payoff in Markov decision processes
di: Gaba, Pranshu, et al.
Pubblicazione: (2025)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
di: D'Amico-Wong, Luca, et al.
Pubblicazione: (2024)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
di: Zhou, Aizhong, et al.
Pubblicazione: (2024)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
di: Gao, Ruiquan, et al.
Pubblicazione: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
di: Brânzei, Simina, et al.
Pubblicazione: (2024)

Committee Elections with Candidate Attribute Constraints
di: Zhou, Aizhong, et al.
Pubblicazione: (2024)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
di: Ghosh, Abheek, et al.
Pubblicazione: (2024)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
di: Bredereck, Robert, et al.
Pubblicazione: (2024)

Reforming an Unfair Allocation by Exchanging Goods
di: Yuen, Sheung Man, et al.
Pubblicazione: (2024)

On the Computation of Equilibria in Discrete First-Price Auctions
di: Filos-Ratsikas, Aris, et al.
Pubblicazione: (2024)

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP^PP
di: Kaczmarek, Joanna, et al.
Pubblicazione: (2024)

Tight Inapproximability of Nash Equilibria in Public Goods Games
di: Dinh, Jérémi Do, et al.
Pubblicazione: (2024)

Envy-Free House Allocation with Minimum Subsidy
di: Choo, Davin, et al.
Pubblicazione: (2024)

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
di: Bernasconi, Martino, et al.
Pubblicazione: (2024)

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
di: Aziz, Haris, et al.
Pubblicazione: (2024)

The Computational Complexity of the Housing Market
di: Lock, Edwin, et al.
Pubblicazione: (2024)

Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier
di: Ron, Shiri, et al.
Pubblicazione: (2024)

Persuading a Credible Agent
di: Gan, Jiarui, et al.
Pubblicazione: (2024)

How to Resolve Envy by Adding Goods
di: Bentert, Matthias, et al.
Pubblicazione: (2025)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
di: Lin, Chuang-Chieh, et al.
Pubblicazione: (2023)

Constant Inapproximability for Fisher Markets
di: Deligkas, Argyrios, et al.
Pubblicazione: (2026)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
di: Hansen, Kristoffer Arnsfelt, et al.
Pubblicazione: (2025)

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments
di: Horn, Laryssa, et al.
Pubblicazione: (2025)

Modelling Network Resilience: The Complexity of Some Graph Division Games
di: Gutowski, Grzegorz, et al.
Pubblicazione: (2026)

Bribery's Influence on Ranked Aggregation
di: Jain, Pallavi, et al.
Pubblicazione: (2026)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2025)

Constant Inapproximability for PPA
di: Deligkas, Argyrios, et al.
Pubblicazione: (2022)

Spatial Voting with Incomplete Voter Information
di: Imber, Aviram, et al.
Pubblicazione: (2023)

Efficiently Computing Equilibria in Budget-Aggregation Games
di: Becker, Patrick, et al.
Pubblicazione: (2025)

On the Complexity of Learning Nash Equilibria
di: Biggar, Oliver, et al.
Pubblicazione: (2026)

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash
di: Babichenko, Yakov, et al.
Pubblicazione: (2015)