Sciweavers

214 search results - page 26 / 43
» Finding Optimal Strategies for Imperfect Information Games
Sort
View
CISS
2007
IEEE
14 years 2 months ago
Towards Optimal Design of Data Hiding Algorithms Against Nonparametric Adversary Models
Abstract—This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm ...
Alvaro A. Cárdenas, George V. Moustakides, ...
DCC
2007
IEEE
14 years 7 months ago
Bayesian Detection in Bounded Height Tree Networks
We study the detection performance of large scale sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards th...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
HIPC
2005
Springer
14 years 1 months ago
Cost-Optimal Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems
Abstract. This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in...
Preetam Ghosh, Kalyan Basu, Sajal K. Das
TSP
2010
13 years 2 months ago
Cooperative resource allocation games under spectral mask and total power constraints
Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division m...
Jie Gao, Sergiy A. Vorobyov, Hai Jiang
WINE
2009
Springer
121views Economy» more  WINE 2009»
14 years 2 months ago
Gaming Dynamic Parimutuel Markets
We study the strategic behavior of risk-neutral non-myopic agents in Dynamic Parimutuel Markets (DPM). In a DPM, agents buy or sell shares of contracts, whose future payoff in a p...
Qianya Lin, Yiling Chen