Image de couverture de livre

An Objective Improvement Approach to Solving Discounted Payoff Games

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dell'Erba, Daniele, Dumas, Arthur, Schewe, Sven
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Compressed Game Solving
par: Considine, Jeffrey
Publié: (2024)

Solving Polynomial Equations Over Finite Fields
par: Dell, Holger, et autres
Publié: (2024)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
par: Tayal, Mumuksh
Publié: (2025)

An $O(n\log n)$ Algorithm for Single-Item Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices
par: Papadopoulos, Kleitos
Publié: (2025)

Algorithms for the local and the global postage stamp problem
par: Palais, Léo Colisson, et autres
Publié: (2026)

Online Allocation with Concave, Diminishing-Returns Objectives
par: Patton, Kalen
Publié: (2025)

Entrywise Approximate Laplacian Solving
par: Chen, Jingbang, et autres
Publié: (2024)

A Nearly Quadratic Improvement for Memory Reallocation
par: Farach-Colton, Martin, et autres
Publié: (2024)

On Solving Linear Systems in Sublinear Time
par: Andoni, Alexandr, et autres
Publié: (2018)

Solving Linear Programs with Differential Privacy
par: Ene, Alina, et autres
Publié: (2025)

Selection Improvements on the Parallel Iterative Algorithm for Stable Matching
par: Wynn, Scott, et autres
Publié: (2024)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
par: Buchbinder, Niv, et autres
Publié: (2025)

Solving Positive Linear Programs with Differential Privacy
par: Ene, Alina, et autres
Publié: (2026)

Solving the Correlation Cluster LP in Sublinear Time
par: Cao, Nairen, et autres
Publié: (2025)

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
par: Kesselheim, Thomas, et autres
Publié: (2025)

FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives
par: Gadekar, Ameet
Publié: (2026)

Solving Hypergraph Laplacian Systems in Almost-Linear Time
par: Yoshida, Yuichi
Publié: (2026)

Tolerant Testing for Unique Games
par: Yoshida, Yuichi
Publié: (2026)

DNA Probe Computing System for Solving NP-Complete Problems
par: Xu, Jin, et autres
Publié: (2025)

On Differential Privacy for Adaptively Solving Search Problems via Sketching
par: Feng, Shiyuan, et autres
Publié: (2025)

On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time
par: Kwok, Tsz Chiu, et autres
Publié: (2025)

Solving Random Planted CSPs below the $n^{k/2}$ Threshold
par: Basu, Arpon, et autres
Publié: (2025)

A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications
par: Dumas, Jean-Guillaume, et autres
Publié: (2026)

When Local and Non-Local Meet: Quadratic Improvement for Edge Estimation with Independent Set Queries
par: Adar, Tomer, et autres
Publié: (2026)

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
par: Jäger, Sven, et autres
Publié: (2024)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
par: Sun, Ming, et autres
Publié: (2022)

Optimizing Distances for Multi-Broadcast in Temporal Graphs
par: Carnevale, Daniele, et autres
Publié: (2026)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
par: Dumas, Maël, et autres
Publié: (2022)

A Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
par: Cenciarelli, Pietro, et autres
Publié: (2016)

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
par: Liu, Yuxi, et autres
Publié: (2024)

The S-Hamiltonian Cycle Problem
par: Amarilli, Antoine, et autres
Publié: (2026)

Fun Maximizing Search, (Non) Instance Optimality, and Video Games for Parrots
par: Barbay, Jérémy
Publié: (2024)

Solving the all pairs shortest path problem after minor update of a large dense graph
par: Liu, Gangli
Publié: (2024)

Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions
par: Pfrommer, Jakob, et autres
Publié: (2022)

Ranking with Multiple Objectives
par: Devanur, Nikhil R., et autres
Publié: (2024)

Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
par: Jäger, Sven, et autres
Publié: (2022)

Hecate: A Modular Genomic Compressor
par: Szewczyk, Kamila, et autres
Publié: (2026)

Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines
par: Hertrich, Christoph, et autres
Publié: (2020)

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
par: Dell, Holger, et autres
Publié: (2022)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
par: Constantinescu, Andrei, et autres
Publié: (2023)