Image de couverture de livre

Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Boros, Endre, Elbassioni, Khaled, Gurvich, Vladimir, Vyalyi, Mikhail
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics Multiagent Systems Optimization and Control 91A05
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities
par: Elbassioni, Khaled
Publié: (2024)

Shortest Paths in Graphs of Convex Sets
par: Marcucci, Tobia, et autres
Publié: (2021)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
par: Lozano, Leonardo, et autres
Publié: (2022)

Growing Trees and Amoebas' Replications
par: Gurvich, Vladimir, et autres
Publié: (2024)

Cluster Assignment in Multi-Agent Systems
par: Sharf, Miel, et autres
Publié: (2022)

Optimal Multi-agent Path Finding in Continuous Time
par: Combrink, Alvin, et autres
Publié: (2025)

Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond
par: Takazawa, Kenjiro
Publié: (2024)

Avoidability beyond paths
par: Gurvich, Vladimir, et autres
Publié: (2022)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
par: Elbassioni, Khaled
Publié: (2025)

Modeling Feasible Locomotion of Nanobots for Cancer Detection and Treatment
par: Harasha, Noble, et autres
Publié: (2025)

$O(p \log d)$ Subgraph Isomorphism using Stigmergic Swarming Agents
par: Parunak, H. Van Dyke
Publié: (2025)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
par: Tellache, Nour ElHouda, et autres
Publié: (2025)

On Nash Equilibria in Play-Once and Terminal Deterministic Graphical Games
par: Boros, Endre, et autres
Publié: (2025)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
par: Thomas, Helen, et autres
Publié: (2025)

Complexity of Maker-Breaker Games on Edge Sets of Graphs
par: Duchêne, Eric, et autres
Publié: (2023)

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
par: Au, Yu Hin, et autres
Publié: (2020)

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
par: Bussemaker, Jasper H., et autres
Publié: (2025)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2023)

A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
par: Takazawa, Kenjiro
Publié: (2024)

Counting of Shortest Paths in Cubic Grid
par: Dutt, Mousumi, et autres
Publié: (2018)

Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm
par: Masing, Berenike, et autres
Publié: (2024)

Logic-Constrained Shortest Paths for Flight Planning
par: Euler, Ricardo, et autres
Publié: (2024)

A convergence technique for the game i-Mark
par: Nivasch, Gabriel, et autres
Publié: (2025)

Additive sink subtraction
par: Bhagat, Anjali, et autres
Publié: (2026)

Minimum Cut Representability of Stable Matching Problems
par: Faenza, Yuri, et autres
Publié: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
par: Alidaee, Bahram, et autres
Publié: (2024)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
par: Moldenhauer, Carsten, et autres
Publié: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
par: Del Pia, Alberto, et autres
Publié: (2022)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
par: Proença, Nathan Benedetto, et autres
Publié: (2026)

Geoffrion's theorem beyond finiteness and rationality
par: Dey, Santanu S., et autres
Publié: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
par: Wang, Changjun, et autres
Publié: (2026)

On the Virtual Network Embedding polytope
par: Benhamiche, Amal, et autres
Publié: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
par: Jabbari-Marand, Behnam, et autres
Publié: (2026)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
par: Bernardelli, Ambrogio Maria, et autres
Publié: (2024)

Order acceptance and scheduling in capacitated job shops
par: Linß, Florian, et autres
Publié: (2024)

A review of minimum cost box searching games
par: Lidbetter, Thomas
Publié: (2025)

Market proliferation and the impact of locational complexity on network restructuring
par: Pinar-Pérez, J. M., et autres
Publié: (2024)

On Supportedness in Multi-Objective Combinatorial Optimization
par: Könen, David, et autres
Publié: (2025)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
par: Swamy, Rahul, et autres
Publié: (2024)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
par: Del Pia, Alberto
Publié: (2025)