of dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy DISTRIBUTED SOLUTIONS FOR RATE CONTROL AND MAXIMUM LIFETIME IN WIRELESS NETWORKS By Liang Zhang August 2009 Chair: Shigang Chen Major: Computer Engineering This study focuses on end-to-end flow rate fairness and lifetime fairness in wire...

The problem of allocating maxmin rates with minimum rate guarantees for connection-oriented networks is considered. This technical report builds on previous work [RT00a, RT00b]. Based on the theory presented in this previous work, an optimally fast maxmin rate allocation protocol called Distributed CPG Protocol is designed. The contributions are twofold. On one hand, the signaling protocol that...

Extensive-form games with imperfect recall are an important model of dynamic games where the players are allowed to forget previously known information. Often, imperfect recall games are the result of an abstraction algorithm that simplifies a large game with perfect recall. Unfortunately, solving an imperfect recall game has fundamental problems since a Nash equilibrium does not have to exist....

The Maxmin Expected Utility decision rule suggests that the decision maker can be characterized by a utility function and a set of prior probabilities, such that the chosen act maximizes the minimal expected utility, where the minimum is taken over the priors in the set. Gilboa and Schmeidler axiomatized the maxmin decision rule in an environment where acts map states of nature into simple lott...

Several flow control algorithms have been proposed for attaining maxmin fair rates. All of these strategies use flow specific states at all nodes in the network, and are hence unsuitable for deployment in the current internet. We propose a new approach which attains maxmin fairness in unicast networks while maintaining per flow states at the edge nodes only. Next, we consider multirate, multica...

We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programmi...

We investigate behavior in two unprofitable games—where Maxmin strategies do not form a Nash equilibrium yet guarantee the same payoff as Nash equilibrium strategies—that vary in the riskiness of the Nash strategy. We find that arguments for the implausibility of Nash equilibrium are confirmed by our experiments; however, claims that this will lead to Maxmin play are not. Neither solution conce...

We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic program...

We investigate the asymptotic behavior of the maxmin values of repeated two-person zero-sum games with a bound on the strategic entropy of the maximizer’s strategies while the other player is unrestricted. We will show that if the Ž . bound h n , a function of the number of repetitions n, satisfies the condition Ž . Ž . nŽ Ž .. Ž .Ž . h n rn a g n a ` , then the maxmin value W h n converges to ...