Skip to search formSkip to main contentSkip to account menu

Adopt: asynchronous distributed constraint optimization with quality guarantees

View via Publisher (opens in a new tab)

Towards Flexible Teamwork

  • Milind Tambe
  • Computer Science
    J. Artif. Intell. Res.
  • 1 July 1997
TLDR
In STEAM, team members monitor the team's and individual members' performance, reorganizing the team as necessary, and decision-theoretic communication selectivity in STEAM ensures reduction in communication overheads of teamwork, with appropriate sensitivity to the environmental conditions.
View PDF on arXiv (opens in a new tab)

The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models

TLDR
A unified framework for multiagent teamwork, the COMmunicative Multiagent Team Decision Problem (COM-MTDP), which combines and extends existing multiagent theories, and provides a basis for the development of novel team coordination algorithms.
View PDF on arXiv (opens in a new tab)

Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings

TLDR
A new class of locally optimal algorithms called Joint Equilibrium-based search for policies (JESP) is presented, and piece-wise linear and convexity (PWLC) properties are proved, thus taking steps towards developing algorithms for continuous belief states.
View Paper (opens in a new tab)

Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games

TLDR
This paper considers Bayesian Stackelberg games, in which the leader is uncertain about the types of adversary it may face, and presents an efficient exact algorithm for finding the optimal strategy for the leader to commit to in these games.
View via Publisher (opens in a new tab)

Distributed Algorithms for DCOP: A Graphical-Game-Based Approach

TLDR
A decomposition of DCOP into a graphical game and the evolution of various stochastic and deterministic algorithms are investigated to prove monotonicity properties of certain approaches and detail arguments about equilibrium sets that offer insight into the tradeoffs involved in leveraging efficiency and solution quality.

Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling

TLDR
The Distributed Multi-Event Scheduling (DiMES) framework is introduced and congruent DCOP formulations with binary constraints which are proven to yield the optimal solution are designed, to approach real-world efficiency requirements.
View on ACM (opens in a new tab)

Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned

TLDR
This book is claimed to be the first and only study of long-term deployed applications of game theory for security for key organizations such as the Los Angeles International Airport police and the U.S. Federal Air Marshals Service.
View Paper (opens in a new tab)

Networked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs

TLDR
Exploiting network structure enables us to present two novel algorithms for ND-POMDPs: a distributed policy generation algorithm that performs local search and a systematic policy search that is guaranteed to reach the global optimal.
View Paper (opens in a new tab)

Computing optimal randomized resource allocations for massive security games

TLDR
A compact model of security games is used, which allows exponential improvements in both memory and runtime relative to the best known algorithms for solving general Stackelberg games and develops even faster algorithms for security games under payoff restrictions that are natural in many security domains.
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)