Sciweavers

228 search results - page 12 / 46
» Expected Reachability-Time Games
Sort
View
ATAL
2006
Springer
14 years 13 days ago
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation
Abstract. We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-...
Tuomas Sandholm, Andrew Gilpin
FMCAD
2009
Springer
14 years 3 months ago
Synthesizing robust systems
—Many specifications include assumptions on the environment. If the environment satisfies the assumptions then a correct system reacts as intended. However, when the environmen...
Roderick Bloem, Karin Greimel, Thomas A. Henzinger...
GAMESEC
2011
287views Game Theory» more  GAMESEC 2011»
12 years 8 months ago
Collaborative Location Privacy with Rational Users
Recent smartphones incorporate embedded GPS devices that enable users to obtain geographic information about their surroundings by providing a location-based service (LBS) with the...
Francisco Santos, Mathias Humbert, Reza Shokri, Je...
INFORMATICASI
2010
13 years 6 months ago
Strategic Modeling of Information Sharing among Data Privacy Attackers
Research in privacy-preserving data publishing has revealed the necessity of accounting for an adversary's background knowledge when reasoning about the protection afforded b...
Quang Duong, Kristen LeFevre, Michael P. Wellman
EOR
2007
123views more  EOR 2007»
13 years 8 months ago
Dynamic programming analysis of the TV game "Who wants to be a millionaire?"
This paper uses dynamic programming to investigate when contestants should use lifelines or when they should just stop answering in the TV quiz show ‘Who wants to be a millionai...
Federico Perea, Justo Puerto