Sciweavers

242 search results - page 43 / 49
» Provably Bounded Optimal Agents
Sort
View
SPAA
1997
ACM
13 years 11 months ago
Efficient Detection of Determinacy Races in Cilk Programs
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...
Mingdong Feng, Charles E. Leiserson
AIPS
2006
13 years 9 months ago
Goal Achievement in Partially Known, Partially Observable Domains
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
Allen Chang, Eyal Amir
ECAI
2010
Springer
13 years 9 months ago
Egalitarian Utilities Divide-and-Coordinate: Stop arguing about decisions, let's share rewards!
Abstract. In this paper we formulate a novel Divide-andCoordinate (DaC) algorithm, the so-called Egalitarian Utilities Divide-and-Coordinate (EU-DaC) algorithm. The Divide-andCoord...
Meritxell Vinyals, Juan A. Rodríguez-Aguila...
FLAIRS
2009
13 years 5 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...