2812 search results - page 266 / 563 » Secrecy in Multiagent Systems |
164
Voted
AAAI
1996
15 years 8 months ago
1996
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...
211
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
164
click to vote
ANOR
2005
15 years 6 months ago
2005
In this paper we consider a game-theoretic dynamic model describing the exploitation of a renewable resource. Our model is based on a Cournot oligopoly game where n profit-maximizi...
212
click to vote
AAMAS
2004
Springer
15 years 6 months ago
2004
Springer
ACT Supporting mobility in a multi hop wireless environment like the MANET still remains a point of research, especially in the context of time-constrained applications. The incapa...
176
click to vote
ATAL
2005
Springer
16 years 3 days ago
2005
Springer
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...