Sciweavers

1380 search results - page 2 / 276
» Computing the optimal strategy to commit to
Sort
View
AAAI
2010
13 years 6 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
ICALP
2007
Springer
13 years 10 months ago
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
P2P
2005
IEEE
13 years 10 months ago
Quantifying Agent Strategies under Reputation
Our research proposes a simple buyer/seller game that captures the incentives dictating the interaction between peers in resource trading peer-to-peer networks. We prove that for ...
Sergio Marti, Hector Garcia-Molina
ATAL
2007
Springer
13 years 11 months ago
Commitment and extortion
Making commitments, e.g., through promises and threats, enables a player to exploit the strengths of his own strategic position as well as the weaknesses of that of his opponents....
Paul Harrenstein, Felix Brandt, Felix A. Fischer
CASCON
1996
151views Education» more  CASCON 1996»
13 years 6 months ago
Performance aspects of dynamic re-allocation for partitioned data
The correct and ecient management of data in distributed databases or mobile computing environments is dicult. Communication disruptions within such systems render the execution o...
Paul A. Jensen, Monica Brockmeyer, Nandit Soparkar