3 papers
cs.LG2025
RedAHD: Reduction-Based End-to-End Automatic Heuristic Design with Large Language Models
Nguyen Thach, Aida Riahifar, Nathan Huynh +1
Solving NP-hard combinatorial optimization problems (COPs) (e.g., traveling salesman problems (TSPs) and capacitated vehicle routing problems (CVRPs)) in practice traditionally inv…
cs.AI2025
CARE: Compatibility-Aware Incentive Mechanisms for Federated Learning with Budgeted Requesters
Xiang Liu, Hau Chan, Minming Li +3
Federated learning (FL) is a promising approach that allows requesters (\eg, servers) to obtain local training models from workers (e.g., clients). Since workers are typically unwi…
cs.AI2024
In-Context Exploiter for Extensive-Form Games
Shuxin Li, Chang Yang, Youzhi Zhang +5
Nash equilibrium (NE) is a widely adopted solution concept in game theory due to its stability property. However, we observe that the NE strategy might not always yield the best re…