#### Filter Results:

- Full text PDF available (166)

#### Publication Year

1984

2017

- This year (2)
- Last 5 years (12)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Contents Credits and Acknowledgments xi Introduction xiii 1 Distributed Constraint Satisfaction 1 1.1 Defining distributed constraint satisfaction problems 2 1.2 Domain-pruning algorithms 5 1.3 Heuristic search algorithms 9 1.3.1 The asynchronous backtracking algorithm 10 1.3.2 A simple example 12 1.3.3 An extended example: the four-queen problem 13 1.3.4… (More)

Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a difficult optimization problem. This is true of mechanisms for combinatorial auctions, which have in recent years assumed practical importance, and in particular of the gold standard for combinatorial auctions, the Generalized Vickrey Auction (GVA).… (More)

- Marko Balabanovic, Yoav Shoham
- Commun. ACM
- 1997

The problem of recommending items from some fixed database has been studied extensively, and two main paradigms have emerged. In content-based recommendation one tries to recommend items similar to those a given user has liked in the past, whereas in collaborative recommendation one identifies users whose tastes are similar to those of the given user and… (More)

- Yoav Shoham
- Logic at Work
- 1992

A new computational framework is presented, called agent-oriented programming (AOP), which can be viewed as a specialization of object-oriented programming. The state of an agent consists of components such as beliefs, decisions, capabilities, and obligations; for this reason the state of an agent is called its mental state. The mental state of agents is… (More)

- Joseph Y. Halpern, Yoav Shoham
- LICS
- 1986

In certain areas of artificial intelligence there is need to represent continuous change and to make statements that are interpreted with respect to time intervals rather than time points. To this end, a modal temporal loglc based on time intervals is developed, a logic that can be viewed as a generalization of point-based modal temporal logic. Related… (More)

General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on algorithms for finding an optimal or approximately optimal set of winning bids. Comparatively little attention has been paid to methodical evaluation and comparison of these algorithms.… (More)

- Yoav Shoham, Moshe Tennenholtz
- Artif. Intell.
- 1997

We deene the notion of social conventions in a standard game-theoretic framework, and identify various criteria of consistency of such conventions with the principle of individual rationality. We then investigate the emergence of such conventions in a stochastic setting; we do so within a stylized framework currently popular in economic circles, namely that… (More)

We present GAMUT^1, a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationships between the sets of games supported by GAMUT, and give an overview of GAMUTýs architecture. We highlight the importance of using comprehensive test data by benchmarking… (More)

- Samuel Ieong, Yoav Shoham
- EC
- 2005

We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characteristics of the interactions among the agents in a natural and concise manner. We also develop efficient algorithms for two of the most important solution concepts, the Shapley value… (More)

- Yoav Shoham
- Artif. Intell.
- 1987