ΑΙhub.org
 

#IJCAI2019 mini-interviews – Claus Aranha from University of Tsukuba


by
14 August 2019



share this:

Meet Claus Aranha, Assistant Professor at the University of Tsukuba, Center of Artificial Intelligence Research (C-AIR).

What are you presenting at IJCAI?
I am organizing the werewolf track ANAC Competition.

 

Can you tell me more about ANAC?
ANAC stands for Automated Agent Negotiation Competition<sup>1</sup>. It is a competition where AI Agents negotiate with each other and/or humans. We have 6 leagues this year – Supply Chain Management, Werewolf (a social party game), Diplomacy (a board game), Human-Agent League, Agent-Agent League: Agent Negotiation with Partial Preferences and the GENIUS league.

 

What is the real world impact of agents negotiating with each other?
Take for example the Supply Chain Management (SCM) league. Right now in the SCM industry many stakeholders – from people who sell the raw material, to factories which produce goods, to shops who sell them are involved. Each one has their preferences on what they wish to get out of the deal and what they are ready to compromise on. They have to coordinate (i.e. negotiate) with each other all the time for timelines, prices, quantities, etc. It is a cumbersome and cognitively heavy job! 

Imagine a group of AI agents representing each stakeholder does this for you. Wouldn’t things become easier?

 

You said something about the werewolf track. Could you say more?
It is a social party game where agents are supposed to find who the werewolf is<sup>2</sup> in a setting where agents lie to each other and/or hide the truth about themselves. How can an agent deal with other agents who behave this way while the agent itself is also deceiving other agents — It is a hard challenge!

We had 90 teams this year out of which 70 sent an agent to the competition. We have 15 finalists and the top three will be discussed tomorrow (August 15)! Keep an eye out 🙂

 

How can I get involved?
Check out the AI Wolf project page3. You can also get some sample code here – https://github.com/caranha/AIWolfCompo

 

1http://web.tuat.ac.jp/~katfuji/ANAC2019/

2https://en.wikipedia.org/wiki/Mafia_(party_game)

3http://aiwolf.org/en/




Rahul Divekar is a PhD Candidate at the Department of Computer Science at Rensselaer Polytechnic Institute.
Rahul Divekar is a PhD Candidate at the Department of Computer Science at Rensselaer Polytechnic Institute.




            AIhub is supported by:


Related posts :



Optimizing LLM test-time compute involves solving a meta-RL problem

  20 Jan 2025
By altering the LLM training objective, we can reuse existing data along with more test-time compute to train models to do better.

Generating a biomedical knowledge graph question answering dataset

  17 Jan 2025
Introducing PrimeKGQA - a scalable approach to dataset generation, harnessing the power of large language models.

The Machine Ethics podcast: 2024 in review with Karin Rudolph and Ben Byford

Karin Rudolph and Ben Byford talk about 2024 touching on the EU AI Act, agent-based AI and advertising, AI search and access to information, conflicting goals of many AI agents, and much more.

Playbook released with guidance on creating images of AI

  15 Jan 2025
Archival Images of AI project enables the creation of meaningful and compelling images of AI.

The Good Robot podcast: Lithium extraction in the Atacama with Sebastián Lehuedé

  13 Jan 2025
Eleanor and Kerry chat to Sebastián Lehuedé about data activism, the effects of lithium extraction, and the importance of reflexive research ethics.

Interview with Erica Kimei: Using ML for studying greenhouse gas emissions from livestock

  10 Jan 2025
Find out about work that brings together agriculture, environmental science, and advanced data analytics.

TELL: Explaining neural networks using logic

  09 Jan 2025
Alessio and colleagues have developed a neural network that can be directly transformed into logic.




AIhub is supported by:






©2024 - Association for the Understanding of Artificial Intelligence


 












©2021 - ROBOTS Association