Yanchen Deng

According to our database1, Yanchen Deng authored at least 19 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Inference-based complete algorithms for asymmetric distributed constraint optimization problems.
Artif. Intell. Rev., May, 2023

Exploring Leximin Principle for Fair Core-Selecting Combinatorial Auctions: Payment Rule Design and Implementation.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Deep Attentive Belief Propagation: Integrating Reasoning and Learning for Solving Constraint Optimization Problems.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Pretrained Cost Model for Distributed Constraint Optimization Problems.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Utility distribution matters: enabling fast belief propagation for multi-agent optimization with dense local utility function.
Auton. Agents Multi Agent Syst., 2021

Neural Regret-Matching for Distributed Constraint Optimization Problems.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
RMB-DPOP: Refining MB-DPOP by Reducing Redundant Inferences.
CoRR, 2020

A hybrid tree-based algorithm to solve asymmetric distributed constraint optimization problems.
Auton. Agents Multi Agent Syst., 2020

Speeding Up Incomplete GDL-based Algorithms for Multi-agent Optimization with Dense Local Utilities.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Battery Management for Automated Warehouses via Deep Reinforcement Learning.
Proceedings of the Distributed Artificial Intelligence - Second International Conference, 2020

RMB-DPOP: Refining MB-DPOP by Reducing Redundant Inference.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

HS-CAI: A Hybrid DCOP Algorithm via Combining Search with Context-Based Inference.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
A Generic Approach for Accelerating Belief Propagation based DCOP Algorithms via A Branch-and-Bound Technique.
CoRR, 2019

AsymDPOP: Complete Inference for Asymmetric Distributed Constraint Optimization Problems.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

PT-ISABB: A Hybrid Tree-based Complete Algorithm to Solve Asymmetric Distributed Constraint Optimization Problems.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

A Generic Approach to Accelerating Belief Propagation Based Incomplete Algorithms for DCOPs via a Branch-and-Bound Technique.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
A class of iterative refined Max-sum algorithms via non-consecutive value propagation strategies.
Auton. Agents Multi Agent Syst., 2018

An Ant-Based Algorithm to Solve Distributed Constraint Optimization Problems.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
An Iterative Refined Max-sum_AD Algorithm via Single-side Value Propagation and Local Search.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017


  Loading...