New Zealand



In kidney exchange programs, multiple patient-donor pairs each
of whom are otherwise incompatible, exchange their donors to
receive compatible kidneys. The Kidney Exchange problem is
typically modelled as a directed graph where every vertex is either
an altruistic donor or a pair of patient and donor; directed edges are
added from a donor to its compatible patients. The computational
task is to find if there exists a collection of disjoint cycles and paths
starting from altruistic donor vertices of length at most ℓ_𝑐 and ℓ_𝑝
respectively that covers at least some specific number 𝑡 of nonaltruistic vertices (patients). We study parameterized algorithms for
the kidney exchange problem in this paper. Specifically, we design
FPT algorithms parameterized by each of the following parameters:
(1) the number of patients who receive kidney, (2) treewidth of the
input graph + max{ℓ_𝑝, ℓ_𝑐 }, and (3) the number of vertex types in the
input graph when ℓ_𝑝 ≤ ℓ_𝑐 . We also present interesting algorithmic
and hardness results on the kernelization complexity of the problem.
Finally, we present an approximation algorithm for an important
special case of Kidney Exchange.

AAMAS 2022

Parameterized Algorithms for Kidney Exchange

trading-chain

trading cycle

compatibility graph

altruistic donors

kernelization

vertex type

kidney exchange

fixed-parameter tractability

AAMAS (International Conference on Autonomous Agents and Multiagent Systems) is the largest and most influential conference in the area of agents and multiagent systems. The aim of the conference is to bring together researchers and practitioners in all areas of agent technology and to provide a single, high-profile, internationally renowned forum for research in the theory and practice of autonomous agents and multiagent systems. AAMAS is the flagship conference of the non-profit International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

The AAMAS conference series was initiated in 2002 in Bologna, Italy as a joint event comprising the 6th International Conference on Autonomous Agents (AA), the 5th International Conference on Multiagent Systems (ICMAS), and the 9th International Workshop on Agent Theories, Architectures, and Languages (ATAL).

Subsequent AAMAS conferences have been held in Melbourne, Australia (July 2003), New York City, NY, USA (July 2004), Utrecht, The Netherlands (July 2005), Hakodate, Japan (May 2006), Honolulu, Hawaii, USA (May 2007), Estoril, Portugal (May 2008), Budapest, Hungary (May 2009), Toronto, Canada (May 2010), Taipei, Taiwan (May 2011), Valencia, Spain (June 2012), Minnesota, USA (May 2013), Paris, France (May 2014), Istanbul, Turkey (May 2015), Singapore (May 2016), São Paulo (2017) and Stockholm, Sweden (2018), Montreal (May 2019), Auckland (May 2020, Virtual), London (May 2021, Virtual).
<br>
<br>



A ticket is required to attend this event, please register using the link below:

https://aamas2022-conference.auckland.ac.nz/attending/registration/

Registration Is Required

AAMAS (International Conference on Autonomous Agents and Multiagent Systems) is the largest and most influential conference in the area of agents and multiagent systems. The aim of the conference is to bring together researchers and practitioners in all areas of agent technology and to provide a single, high-profile, internationally renowned forum for research in the theory and practice of autonomous agents and multiagent systems. AAMAS is the flagship conference of the non-profit International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

poster

**Read paper on the following link:**

https://ifaamas.org/Proceedings/aamas2022/pdfs/p1563.pdf

**Abstract:**



Optimal Local Bayesian Differential Privacy over Markov Chains


In MARL, communication among agents is essential to establish cooperation. Over the realistic wireless network, many factors can affect transmission reliability, especially considering that the wireless network condition varies with agents’ mobility. We propose a framework that improves the intelligence of communication over realistic wireless networks in two fundamental aspects: (1) When: Agents learn the timing of communication based on message importance and wireless channel condition. We further propose a communication lagging technique to make the training end-to-end differentiable. (2) What: Agents augment message contents with
wireless network measurements. The messages improve both the game and communication actions of the agents. Experiments on a standard environment show that compared with state-of-the-art, our framework enables more intelligent collaboration and thus achieves significantly better game performance, convergence speed and communication efficiency.

Intelligent Communication over Realistic Wireless Networks in Multi-Agent Cooperative Games

Federated learning (FL) allows distributed clients to collaboratively train a global model without sharing their private data. We propose a novel FL algorithm, which can accurately evaluate the contributions of clients and aggregate global model in a more efficient manner. More specifically, we propose to use a Deep Reinforcement Learning (DRL) method to dynamically learn the contributions of clients in each communication round. Based on this, we adaptively assign appropriate weights to clients, which will be used in global model aggregation. By improving the process of global mode aggregation, our proposed scheme greatly improves the performance of federated learning.

Adaptive Aggregation Weight Assignment for Federated Learning: A Deep Reinforcement Learning Approach


PointGoal navigation has seen significant recent interest and progress,
spurred on by the Habitat platform and associated challenge.
In this paper, we study PointGoal navigation under both a sample
budget (75 million frames) and a compute budget (1 GPU for 1 day).
We conduct an extensive set of experiments, cumulatively totaling
over 50,000 GPU-hours, that let us identify and discuss a number of
ostensibly minor but significant design choices – the advantage esti-
mation procedure (a key component in training), and visual encoder
architecture. Overall, these design choices lead to considerable and
consistent improvements. Under a sample budget, performance for
RGB-D agents improves 3 SPL on Gibson (4% relative improvement)
and 20 SPL on Matterport3D (43% relative improvement). Under a
compute budget, performance for RGB-D agents improves by 3 SPL
on Gibson (5% relative improvement) and 15 SPL on Matterport3D
(50% relative improvement). Our findings and recommendations
will serve to make the community’s experiments more efficient – to
reach 50 SPL with RGB-D on Matterport3D, they reduce the samples
needed by 3x and the training time 2x.

How to Train PointGoal Navigation Agents on a (Sample and Compute) Budget

Multiagent self-assembly allows collectives to reach areas otherwise inaccessible to any particular agent. However, the coordination of this collective is not trivial, so each agent’s position in the structure is usually determined apriori. In our approach, we take inspiration from army ants and use a simulated model of the Eciton Robotica robot to form emergent structures with bio-inspired local rules. We demonstrate that by coupling this with traffic control, we can induce the formation of a structure and control certain characteristics without pre-computed paths or central coordination.

Influencing Emergent Self-Assembled Structures in Robotic Collectives Through Traffic Control

**Read paper on the following link:**

https://ifaamas.org/Proceedings/aamas2022/pdfs/p1536.pdf

**Abstract:**



Can Algorithms be Explained Without Compromising Efficiency? The Benefits of Detection and Imitation in Strategic Classification


Representation learning on visualized input is an essential yet challenging task for deep reinforcement learning (RL). While training agents using deep reinforcement learning algorithms, we usually assume that the agent could extract appropriate features and take actions accordingly. However, learning essential and generalizable features based on high-dimensional input images is a great challenge. To help the RL agent learn more general and discriminative representation
among various states, we present cross-state self-constraint (CSSC). This novel technique regularizes representation learning by comparing state embedding similarities across different state-action pairs. We test our proposed method on the OpenAI Procgen benchmark with Rainbow and PPO and demonstrate significant improvement across most Procgen environments.

Improving Generalization with Cross-State Behavior Matching in Deep Reinforcement Learning


Measuring and comparing resilience is crucial for evaluating different algorithms’ performance. Existing resilience metrics focus on a system’s ability to maintain a particular state, but are inadequate to evaluate whether a system can achieve a novel state after an unexpected disturbance. The presented resilience power metric is used to analyze two best-of-N algorithms. Both algorithms exhibited high resilience power when changing the collective’s population size, but this result did not correlate with high overall task performance.

Measuring Resilience in Collective Robotic Algorithms


Covering option discovery has been developed to improve the exploration of reinforcement learning in single-agent scenarios with sparse reward signals, through connecting the most distant states in the embedding space provided by the Fiedler vector of the state transition graph. However, due to exponentially-large state space
resulted from multi-agent scenarios, existing researches on adopting options in multi-agent scenarios still rely on single-agent option discovery and fail to directly discover the joint options that can improve the connectivity of the joint state space of agents. In this paper, we show that it is indeed possible to directly compute
multi-agent options with collaborative exploratory behavior while still enjoying the ease of decomposition. Our key idea is to approximate the joint state space as a kronecker graph – the kronecker product of individual agents’ state transition graphs, based on which we can directly estimate the Fiedler vector of the joint
state space using the Laplacian spectrum of individual agents’ transition graphs. This decomposition enables us to efficiently construct multi-agent joint options by encouraging agents to connect the sub-goal joint states which are corresponding to the minimum or maximum values of the estimated joint Fiedler vector. The evaluation based on multi-agent collaborative tasks shows that the proposed
algorithm can successfully identify multi-agent options, and significantly outperforms prior works using single-agent options or no options, in terms of both faster exploration and higher cumulative rewards.

Multi-agent Covering Option Discovery through Kronecker Product of Factor Graphs

**Read paper on the following link:**

https://ifaamas.org/Proceedings/aamas2022/pdfs/p1592.pdf

**Abstract:**



Downloads

Next from AAMAS 2022

Optimal Local Bayesian Differential Privacy over Markov Chains

Similar lecture

On Parameterized Complexity of Binary Networked Public Goods Game

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from AAMAS 2022

Optimal Local Bayesian Differential Privacy over Markov Chains

Similar lecture

On Parameterized Complexity of Binary Networked Public Goods Game

Downloads