Sciweavers

402 search results - page 71 / 81
» Maximal Introspection of Agents
Sort
View
90
Voted
WETICE
2002
IEEE
15 years 5 months ago
Analysis of an Anonymity Network for Web Browsing
Various systems offering anonymity for near real-time Internet traffic have been operational. However, they did not deliver many quantitative results about performance, bandwidth...
Marc Rennhard, Sandro Rafaeli, Laurent Mathy, Bern...
KR
2010
Springer
15 years 5 months ago
I Don't Want to Think About it Now: Decision Theory with Costly Computation
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
Joseph Y. Halpern
111
Voted
CP
1997
Springer
15 years 4 months ago
Distributed Partial Constraint Satisfaction Problem
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 ...
Katsutoshi Hirayama, Makoto Yokoo
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
15 years 1 months ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
IJCAI
2003
15 years 1 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
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 proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...