Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Individual Planning in Agent Populations: Exploiting Anonymity and Frame-Action Hypergraphs (1503.07220v2)

Published 24 Mar 2015 in cs.MA, cs.AI, and cs.GT

Abstract: Interactive partially observable Markov decision processes (I-POMDP) provide a formal framework for planning for a self-interested agent in multiagent settings. An agent operating in a multiagent environment must deliberate about the actions that other agents may take and the effect these actions have on the environment and the rewards it receives. Traditional I-POMDPs model this dependence on the actions of other agents using joint action and model spaces. Therefore, the solution complexity grows exponentially with the number of agents thereby complicating scalability. In this paper, we model and extend anonymity and context-specific independence -- problem structures often present in agent populations -- for computational gain. We empirically demonstrate the efficiency from exploiting these problem structures by solving a new multiagent problem involving more than 1,000 agents.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Ekhlas Sonu (1 paper)
  2. Yingke Chen (6 papers)
  3. Prashant Doshi (34 papers)
Citations (15)

Summary

We haven't generated a summary for this paper yet.