We study the asymptotic optimal control of multi-class restless bandits. A restless bandit isa controllable stochastic process whose state evolution depends on whether or not the bandit ismade active. Since finding the optimal control is typically intractable, we propose a class of prioritypolicies that are proved to be asymptotically optimal under a global attractor property an...

This thesis studies the multiple description vector quantization with lattice codebooks (MDLVQ). The design of index assignment is crucial to the performance of MDLVQ. However, to our best knowledge, none of previous index assignment algorithms for MDLVQ is optimal. In this thesis, we propose a simple linear-time index assignment algorithm for MDLVQ with any K ≥ 2 balanced descriptions. We prov...

In this paper, we establish new capacity bounds for the multi-sender unicast index-coding problem. We first revisit existing outer and inner bounds proposed by Sadeghi et al. and identify their suboptimality in general. We then propose a new multi-sender maximal-acyclic-induced-subgraph outer bound that improves upon the existing bound in two aspects. For inner bound, we identify shortcomings o...

Consider a decision maker who is responsible to dynamically collect observations so as to enhance his information about an underlying phenomena of interest in a speedy manner while accounting for the penalty of wrong declaration. Due to the sequential nature of the problem, the decision maker relies on his current information state to adaptively select the most “informative” sensing action amon...

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv DEDICATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v ACKNOWLEDGEMENT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi 1.0 INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.0 ENDOGENOUS FORMATION OF A BIDDING RING . . . . . . . . . 3 ...

This paper describes a game-theoretic methodology to design and embed watermarks in images. The optimality criterion is probability of error of the decoder. Analytical solutions are presented for problems involving Gaussian host images and illustrated with examples. Significant improvements over previous designs are obtained.