Cover Image

Greedy Routing Reachability Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lenzner, Pascal, Machaira, Paraskevi
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Strategic Network Creation for Enabling Greedy Routing
by: Berger, Julian, et al.
Published: (2024)

Social Welfare in Battery Charging Games
by: Krogmann, Simon, et al.
Published: (2025)

The Bakers and Millers Game with Restricted Locations
by: Krogmann, Simon, et al.
Published: (2025)

Network Creation Games with 2-Neighborhood Maximization
by: de la Haye, Merlin, et al.
Published: (2025)

Cooperation in Bilateral Generalized Network Creation
by: Gawendowicz, Hans, et al.
Published: (2025)

Two-Stage Facility Location Games with Strategic Clients and Facilities
by: Krogmann, Simon, et al.
Published: (2021)

Metric Hedonic Games on the Line
by: de la Haye, Merlin, et al.
Published: (2026)

Temporal Network Creation Games: The Impact of Non-Locality and Terminals
by: Bilò, Davide, et al.
Published: (2024)

Permissive Equilibria in Multiplayer Reachability Games
by: Goeminne, Aline, et al.
Published: (2024)

Robin Hood Reachability Bidding Games
by: Almagor, Shaull, et al.
Published: (2024)

Generalised Reachability Games Revisited
by: Bose, Sougata, et al.
Published: (2025)

Strategic Facility Location with Clients that Minimize Total Waiting Time
by: Krogmann, Simon, et al.
Published: (2022)

Optimal Welfare in Noncooperative Network Formation under Attack
by: Doubez, Natan, et al.
Published: (2025)

Verification of Correlated Equilibria in Concurrent Reachability Games
by: Rajasekaran, Senthil, et al.
Published: (2026)

Multi-weighted Reachability Games and Their Application to Permissiveness
by: Brihaye, Thomas, et al.
Published: (2023)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
by: Constantinescu, Andrei, et al.
Published: (2023)

Games on Graphs: A Time-Efficient Algorithm for Solving Finite Reachability and Safety Games
by: Giannetti, Christian
Published: (2024)

Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
by: Main, James C. A.
Published: (2023)

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

Strategic Resource Selection with Homophilic Agents
by: Harder, Jonathan Gadea, et al.
Published: (2023)

A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem
by: Sanim, Md. Musfiqur Rahman, et al.
Published: (2024)

Mechanism Design for Automated Market Makers
by: Chan, T-H. Hubert, et al.
Published: (2024)

On the Price of Anarchy in Packet Routing Games with FIFO
by: Schmand, Daniel, et al.
Published: (2025)

Escaping a Polygon
by: Abel, Zachary, et al.
Published: (2020)

To Optimize Human-in-the-loop Learning in Repeated Routing Games
by: Li, Hongbo, et al.
Published: (2024)

Equilibria in Two-Stage Facility Location with Atomic Clients
by: Krogmann, Simon, et al.
Published: (2024)

Automated Approach for Solving Infinite-state Polynomial Reachability Games
by: Chatterjee, Krishnendu, et al.
Published: (2026)

Bidding Games on Markov Decision Processes with Quantitative Reachability Objectives
by: Avni, Guy, et al.
Published: (2024)

Pricing Online LLM Services with Data-Calibrated Stackelberg Routing Game
by: Guo, Zhendong, et al.
Published: (2025)

A Scalable Game-theoretic Approach to Urban Evacuation Routing and Scheduling
by: Islam, Kazi Ashik, et al.
Published: (2024)

Decision-Making on Timing and Route Selection: A Game-Theoretic Approach
by: Wang, Chenlan, et al.
Published: (2025)

Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
by: Brihaye, Thomas, et al.
Published: (2023)

Misère Greedy Nim and Misère Bounded Greedy Nim
by: Omiya, Nanako, et al.
Published: (2025)

Reachability and Safety Games under TSO Semantics (Extended Version)
by: Spengler, Stephan
Published: (2024)

Decision-Making Under Complete Uncertainty: You Will Regret Not Being Greedy
by: Atanasov, Kristijan, et al.
Published: (2025)

Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions
by: Ouhamma, Reda, et al.
Published: (2023)

Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
by: Berthon, Raphaël, et al.
Published: (2024)

Reachability of Fair Allocations via Sequential Exchanges
by: Igarashi, Ayumi, et al.
Published: (2023)

Iterative Recommendations based on Monte Carlo Sampling and Trust Estimation in Multi-Stage Vehicular Traffic Routing Games
by: Brown, Doris E. M., et al.
Published: (2025)

A Convex Formulation of Game-theoretic Hierarchical Routing
by: Lee, Dong Ho, et al.
Published: (2025)