2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.GT2023
Exploring Leximin Principle for Fair Core-Selecting Combinatorial Auctions: Payment Rule Design and Implementation
Hao Cheng, Shufeng Kong, Yanchen Deng +4
Core-selecting combinatorial auctions (CAs) restrict the auction result in the core such that no coalitions could improve their utilities by engaging in collusion. The minimum-reve…
cs.AI2022★ 2 cited
Deep Attentive Belief Propagation: Integrating Reasoning and Learning for Solving Constraint Optimization Problems
Yanchen Deng, Shufeng Kong, Caihua Liu +1
Belief Propagation (BP) is an important message-passing algorithm for various reasoning tasks over graphical models, including solving the Constraint Optimization Problems (COPs).…
cs.AI2021
Pretrained Cost Model for Distributed Constraint Optimization Problems
Yanchen Deng, Shufeng Kong, Bo An
Distributed Constraint Optimization Problems (DCOPs) are an important subclass of combinatorial optimization problems, where information and controls are distributed among multiple…