6 citations · 15 across the 8 of their papers we have counts for
8 papers
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…
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).…
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…
RMB-DPOP: Refining MB-DPOP by Reducing Redundant Inferences
Ziyu Chen, Wenxin Zhang, Yanchen Deng +2
MB-DPOP is an important complete algorithm for solving Distributed Constraint Optimization Problems (DCOPs) by exploiting a cycle-cut idea to implement memory-bounded inference. Ho…
HS-CAI: A Hybrid DCOP Algorithm via Combining Search with Context-based Inference
Dingding Chen, Yanchen Deng, Ziyu Chen +2
Search and inference are two main strategies for optimally solving Distributed Constraint Optimization Problems (DCOPs). Recently, several algorithms were proposed to combine their…
A Generic Approach for Accelerating Belief Propagation based DCOP Algorithms via A Branch-and-Bound Technique
Ziyu Chen, Xingqiong Jiang, Yanchen Deng +2
Belief propagation approaches, such as Max-Sum and its variants, are a kind of important methods to solve large-scale Distributed Constraint Optimization Problems (DCOPs). However,…
AsymDPOP: Complete Inference for Asymmetric Distributed Constraint Optimization Problems
Yanchen Deng, Ziyu Chen, Dingding Chen +2
Asymmetric distributed constraint optimization problems (ADCOPs) are an emerging model for coordinating agents with personal preferences. However, the existing inference-based comp…
PT-ISABB: A Hybrid Tree-based Complete Algorithm to Solve Asymmetric Distributed Constraint Optimization Problems
Yanchen Deng, Ziyu Chen, Dingding Chen +2
Asymmetric Distributed Constraint Optimization Problems (ADCOPs) have emerged as an important formalism in multi-agent community due to their ability to capture personal preference…