#### Filter Results:

- Full text PDF available (213)

#### Publication Year

1990

2017

- This year (10)
- Last 5 years (81)
- Last 10 years (154)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Makoto Yokoo
- Artif. Intell.
- 2005

The Distributed Constraint Optimization Problem (DCOP) is a promising approach for modeling distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while allowing agents to operate asynchronously. We show how this failure can be remedied… (More)

- Makoto Yokoo, Edmund H. Durfee, Toru Ishida, Kazuhiro Kuwabara
- IEEE Trans. Knowl. Data Eng.
- 1998

In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in Distributed Artificial Intelligence can be… (More)

- Makoto Yokoo, Katsutoshi Hirayama
- Autonomous Agents and Multi-Agent Systems
- 2000

When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. Various application problems in multi-agent systems can be… (More)

- Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. Pynadath, Stacy Marsella
- IJCAI
- 2003

The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision process (POMDP). Yet, despite the growing importance and applications of decentralized POMDP models in the multiagents arena, few algorithms have been developed for efficiently deriving… (More)

- Makoto Yokoo, Edmund H. Durfee, Toru Ishida, Kazuhiro Kuwabara
- ICDCS
- 1992

Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particular, we present our newly developed technique called… (More)

In many real-world multiagent applications such as distributed sensor nets, a network of agents is formed based on each agent’s limited interactions with a small number of neighbors. While distributed POMDPs capture the real-world uncertainty in multiagent domains, they fail to exploit such locality of interaction. Distributed constraint optimization (DCOP)… (More)

This paper presents a new algorithm for solving distributed constraint satisfaction problems (distributed CSPs) called the distributed breakout algorithm, which is inspired by the breakout algorithm for solving centraiized CSPs. In this algorithm, each agent tries to optimize its evaluation value (the number of constraint violations) by exchanging its… (More)

- Katsutoshi Hirayama, Makoto Yokoo
- CP
- 1997

Many problems in multi-agent systems can be described as Distributed Constraint Satisfaction Problems (Distributed CSPs), where the goal is to nd a set of assignments to variables that satis es all constraints among agents. However, when real-life application problems are formalized as Distributed CSPs, they are often over-constrained and have no solution… (More)

- Makoto Yokoo, Katsutoshi Hirayama
- ICMAS
- 1998

A distributed constraint satisfaction problem can formalize various application problems in MAS, and several algorithms for solving this problem have been developed. One limitation of these algorithms is that they assume each agent has only one local variable. Although simple modifications enable these algorithms to handle multiple local variables, obtained… (More)

- Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Makoto Yokoo
- AAMAS
- 2003

We present a new polynomial-space algorithm, called <i>Adopt</i>, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi agent systems where a solution within given quality parameters must be found. Existing methods for DCOP are not able to provide theoretical guarantees on global solution… (More)