We are providing an unedited version of this manuscript to give early access to its findings. Before final publication, the manuscript will undergo further editing. Please note there may be errors ...
Designing polynomial-time algorithms for approximate Nash equilibria (ANE) with provable worst-case guarantees is a fundamental open problem in algorithmic game theory. While large language models ...
Abstract: This paper proposes a multi-UAV path planning method based on an improved Hummingbird Algorithm (AHA). To address the original AHA’s tendency to become trapped in local optima and its slow ...
Abstract: The Multi-depot Vehicle Routing Problem with Uncertain Demand (MD-VRPUD) can be modeled as a bi-level optimization problem (BLOP), because it requires both assigning customers to different ...