We introduce a class of conjunctive structures of second order for which the consistent labeling problem is solvable in polynomial time. This result is generalized then to a class of “maxmin” problems.

I introduce novel preference formulations which capture aversion to ambiguity about unknown and potentially time-varying volatility. compare these preferences with Gilboa Schmeidler's maxmin expected utility as well variational of aversion. The impact is illustrated in a simple static model portfolio choice, dynamic optimal contracting under repeated moral hazard. Implications for investor beli...

background: birth weight and gestational age are two important variables in obstetric research. the primary measure of gestational age is based on a mother's recall of her last menstrual period. this recall may cause random or systematic errors. therefore, the objective of this study is to utilize bayesian mixture model in order to identify implausible gestational age.   methods: in this cross-...

background:growth is one of the most important indices in child health. the best and most effective way to investigate child health is measuring the physical growth indices such as weight, height and head circumference. among these measures, weight growth is the simplest and the most effective way to determine child growth status. weight trend at a given age is the result of cumulative growth e...

To promote commercial deployment of multihop wireless networks, the research/industry communities must develop new theories and protocols for flexible traffic engineering in these networks in order to support diverse user applications. This paper studies an important traffic engineering problem – how to support fair bandwidth allocation among all end-to-end flows in a multihop wireless network ...

This paper describes an algorithm that computes the maxmin fair allocation of rates for flows through an input-queued switch. The algorithm is provably max-min fair and can be implemented in a distributed fashion to dynamically determine flow rates.

This paper rigorously examines a dynamic behavioral foundation of the Rawlsian criterion, that selects a social outcome which maximizes the payoff of the worst off agent. In order to understand how the behavior of individual agents shapes up this social norm through repeated long term interactions among agents, we analyze a dynamic matching process in which a long term relationship is embedded....

The paper studies the problem of reachability for linear systems in the presence of uncertain (unknown but bounded) input disturbances, which may also be interpreted as the action of an adversary in a gametheoretic setting. It defines possible notions of reachability under uncertainty emphasizing the differences between open-loop and closed-loop control. Solution schemes for calculating reachab...

Without assuming any knowledge on source’s codebook and its output signals, we formulate a Gaussian jamming problem in block fading channels as a two-player zero sum game. The outage probability is adopted as an objective function, over which transmitter aims at minimization and jammer aims at maximization by selecting their power control strategies. Optimal power control strategies for each pl...