Sciweavers

408 search results - page 38 / 82
» Cooperative checkpointing theory
Sort
View
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
14 years 2 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
ACL
2001
13 years 11 months ago
Resolving Ellipsis in Clarification
We offer a computational analysis of the resolution of ellipsis in certain cases of dialogue clarification. We show that this goes beyond standard techniques used in anaphora and ...
Jonathan Ginzburg, Robin Cooper
DM
2008
112views more  DM 2008»
13 years 10 months ago
On the vertices of the k-additive core
The core of a game v on N, which is the set of additive games dominating v such that (N) = v(N), is a central notion in cooperative game theory, decision making and in combinator...
Michel Grabisch, Pedro Miranda
CN
2006
95views more  CN 2006»
13 years 10 months ago
Generalized Nash Bargaining Solution for bandwidth allocation
For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game theory has been used in networks to share resources fairly. Due to its many appealing propertie...
Corinne Touati, Eitan Altman, Jérôme ...
ENTCS
2006
127views more  ENTCS 2006»
13 years 10 months ago
Process Algebraic Non-product-forms
A generalization of the Reversed Compound Agent Theorem of Markovian process algebra is derived that yields separable, but non-product-form solutions for collections of interactin...
Peter G. Harrison