38 citations · 84 across the 10 of their papers we have counts for
13 papers
Adaptive Discounting of Training Time Attacks
Ridhima Bector, Abhay Aradhya, Chai Quek +1
Among the most insidious attacks on Reinforcement Learning (RL) solutions are training-time attacks (TTAs) that create loopholes and backdoors in the learned behaviour. Not limited…
Towards Skilled Population Curriculum for Multi-Agent Reinforcement Learning
Rundong Wang, Longtao Zheng, Wei Qiu +7
Recent advances in multi-agent reinforcement learning (MARL) allow agents to coordinate their behaviors in complex environments. However, common MARL algorithms still suffer from s…
Off-Beat Multi-Agent Reinforcement Learning
Wei Qiu, Weixun Wang, Rundong Wang +7
We investigate model-free multi-agent reinforcement learning (MARL) in environments where off-beat actions are prevalent, i.e., all actions have pre-set execution durations. During…
Mis-spoke or mis-lead: Achieving Robustness in Multi-Agent Communicative Reinforcement Learning
Wanqi Xue, Wei Qiu, Bo An +3
Recent studies in multi-agent communicative reinforcement learning (MACRL) have demonstrated that multi-agent coordination can be greatly improved by allowing communication between…
RMIX: Learning Risk-Sensitive Policies for Cooperative Reinforcement Learning Agents
Wei Qiu, Xinrun Wang, Runsheng Yu +5
Current value-based multi-agent reinforcement learning methods optimize individual Q values to guide individuals' behaviours via centralized training with decentralized execution (…
Manipulating Elections by Selecting Issues
Jasper Lu, David Kai Zhang, Zinovi Rabinovich +2
Constructive election control considers the problem of an adversary who seeks to sway the outcome of an electoral process in order to ensure that their favored candidate wins. We c…
Learning Efficient Multi-agent Communication: An Information Bottleneck Approach
Rundong Wang, Xu He, Runsheng Yu +3
We consider the problem of the limited-bandwidth communication for multi-agent reinforcement learning, where agents cooperate with the assistance of a communication protocol and a…
Protecting Elections by Recounting Ballots
Edith Elkind, Jiarui Gan, Svetlana Obraztsova +2
Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party…
New Algorithms for Functional Distributed Constraint Optimization Problems
Khoi D. Hoang, William Yeoh, Makoto Yokoo +1
The Distributed Constraint Optimization Problem (DCOP) formulation is a powerful tool to model multi-agent coordination problems that are distributed by nature. The formulation is…
Lie on the Fly: Strategic Voting in an Iterative Preference Elicitation Process
Lihi Dery, Svetlana Obraztsova, Zinovi Rabinovich +1
A voting center is in charge of collecting and aggregating voter preferences. In an iterative process, the center sends comparison queries to voters, requesting them to submit thei…
Reaching Consensus Under a Deadline
Marina Bannikova, Lihi Dery, Svetlana Obraztsova +2
Committee decisions are complicated by a deadline, e.g., the next start of a budget, or the beginning of a semester. In committee hiring decisions, it may be that if no candidate i…
Imitative Follower Deception in Stackelberg Games
Jiarui Gan, Haifeng Xu, Qingyu Guo +3
Information uncertainty is one of the major challenges facing applications of game theory. In the context of Stackelberg games, various approaches have been proposed to deal with t…
Security Games with Information Leakage: Modeling and Computation
Haifeng Xu, Albert X. Jiang, Arunesh Sinha +3
Most models of Stackelberg security games assume that the attacker only knows the defender's mixed strategy, but is not able to observe (even partially) the instantiated pure strat…