Cheung, Man Wah. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 50-53). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Stochastic Stability --- p.2 / Chapter 1.2 --- Some Examples --- p.3 / Chapter 1.3 --- Our Main Focus --- p.5 / Chapter 1.4 --- Thesis Outline --- p.6 / Chapter 2 --- KMR's Approach and its Variations --- p.7 / Chapter 2.1 --- KMR's Approach --- p.7 / Chapter 2.2 --- Variations --- p.12 / Chapter 2.2.1 --- Bergin and Lipman (1996) --- p.12 / Chapter 2.2.2 --- Anderlini and Ianni (1996) --- p.12 / Chapter 2.2.3 --- Robson and Vega-Redondo (1996) --- p.13 / Chapter 2.2.4 --- Robles (1998) and Pak (2008) --- p.13 / Chapter 3 --- Mathematical Reviews on Nonstationary Markov Chain --- p.15 / Chapter 3.1 --- Ergodic Coefficient --- p.15 / Chapter 3.2 --- Weak Ergodicity --- p.16 / Chapter 3.3 --- Strong Ergodicity --- p.18 / Chapter 4 --- Existing Works on Time-Dependent Mutation Rates --- p.20 / Chapter 4.1 --- Model and Definitions --- p.20 / Chapter 4.2 --- Sufficient Condition for Weak Ergodicity --- p.23 / Chapter 4.3 --- Sufficient Condition for Strong Ergodicity --- p.24 / Chapter 5 --- Time-Dependent Mutations and Empirical Distribution --- p.26 / Chapter 5.1 --- Model --- p.28 / Chapter 5.2 --- Convergence of Empirical Distribution --- p.30 / Chapter 5.3 --- Proofs of Claims --- p.35 / Chapter 5.3.1 --- Proofs of Claims l(a)-(d) --- p.36 / Chapter 5.3.2 --- Proof of Claim 2 --- p.39 / Chapter 6 --- Open Problems --- p.42 / Chapter 6.1 --- Numerical Example and Simulations --- p.43 / Chapter 6.2 --- Numerical Results --- p.44 / Chapter 6.3 --- Other Discussions --- p.47 / Chapter 7 --- Conclusion --- p.48 / Bibliography --- p.50

Abstract not available

Thesis (M. Econ.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 95-96).

We study algorithms and models for several economics-related problems from the perspective of linear programming. In network bargaining games, stable and balanced outcomes have been investigated in previous work. However, existence of such outcomes requires that the linear program relaxation of a certain maximum matching problem has integral optimal solution. We propose an alternative model for network bargaining games in which each edge acts as a player, who proposes how to split the weight of the edge among the two incident nodes. We show that the distributed protocol by Kanoria et. al can be modified to be run by the edge players such that the configuration of proposals will converge to a pure Nash Equilibrium, without the linear program integrality gap assumption. Moreover, ambiguous choices can be resolved in a way such that there exists a Nash Equilibrium that will not hurt the social welfare too much. In the oblivious matching problem, an algorithm aims to find a maximum matching while it can only makes (random) decisions that are essentially oblivious to the input graph. Any greedy algorithm can achieve performance ratio 0:5, which is the expected number of matched nodes to the number of nodes in a maximum matching. We revisit the Ranking algorithm using the linear programming framework, where the constraints of the linear program are given by the structural properties of Ranking. We use continuous linear program relaxation to analyze the limiting behavior as the finite linear program grows. Of particular interest are new duality and complementary slackness characterizations that can handle monotone constraints and mixed evolving and boundary constraints in continuous linear program, which enable us to achieve a theoretical ratio of 0:523 on arbitrary graphs. The J-choice K-best secretary problem, also known as the (J;K)-secretary problem, is a generalization of the classical secretary problem. An algorithm for the (J;K)-secretary problem is allowed to make J choices and the payoff to be maximized is the expected number of items chosen among the K best items. We use primal-dual continuous linear program techniques to analyze a class of infinite algorithms, which are general enough to capture the asymptotic behavior of the finite model with large number of items. Our techniques allow us to prove that the optimal solution can be achieved by a (J;K)-threshold algorithm, which has a nice \rational description" for the case K = 1. / published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy

Not available / text

Not available / text

No description available.

No description available.

No description available.

No description available.