1380 search results - page 12 / 276 » Computing the optimal strategy to commit to |
AIPS
2000
13 years 9 months ago
2000
Thefocus of this workis the computationof efficient strategies for commoditytrading in a multi-marketenvironment. In today's "global economy"commodities are often b...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
CIS
2008
Springer
13 years 9 months ago
2008
Springer
Delivering continuous services in information infrastructures is a major challenge. For system or network administrators, redundancy allocation is one of the best strategies to en...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
We consider timed games extended with cost information, and prove computability of the optimal cost and of -optimal memoryless strategies in timed games with one clock. In contrast...