Sciweavers

54 search results - page 11 / 11
» A Cryptographic Solution to a Game Theoretic Problem
Sort
View
AI
2008
Springer
13 years 5 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
CCS
2003
ACM
13 years 10 months ago
On the performance, feasibility, and use of forward-secure signatures
Forward-secure signatures (FSSs) have recently received much attention from the cryptographic theory community as a potentially realistic way to mitigate many of the difficulties...
Eric Cronin, Sugih Jamin, Tal Malkin, Patrick Drew...
IJCAI
1993
13 years 6 months ago
Provably Bounded Optimal Agents
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
Stuart J. Russell, Devika Subramanian, Ronald Parr
CORR
2008
Springer
170views Education» more  CORR 2008»
13 years 5 months ago
To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
Sudhir Kumar Singh, Vwani P. Roychowdhury