Sciweavers

4595 search results - page 626 / 919
» Reasoning about Plans
Sort
View
PODC
2010
ACM
14 years 2 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
14 years 2 months ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
AI
2006
Springer
14 years 2 months ago
Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games
So far, most equilibrium concepts in game theory require that the rewards and actions of the other agents are known and/or observed by all agents. However, in real life problems, a...
Stéphane Ross, Brahim Chaib-draa
ATAL
2006
Springer
14 years 2 months ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
ATAL
2006
Springer
14 years 2 months ago
Web presentation system using RST events
Constructing presentations as stories is about presenting events that receive their relevance and meaning within the context of the presentation, and about means to define a well-...
Arturo Nakasone, Helmut Prendinger, Mitsuru Ishizu...