Dynamic State Tameness

An extension of the idea of state tameness is presented in a dynamic framework. The proposed model for financial markets is rich enough to provide analytical tools that are mostly obtained in models that arise as the solution of SDEs with deterministic coefficients. In the presented model the augmentation by a shadow stock of the price evolution has a Markovian character. As in a previous paper, the results obtained on valuation of European contingent claims and American contingent claims do not require the full range of the volatility matrix. Under some additional continuity conditions, the conceptual framework provided by the model makes it possible to regard the valuation of financial instruments of the European type as a particular case of valuation of instruments of American type. This provides a unifying framework for the problem of valuation of financial instruments.arbitrage; pricing of contingent claims; continuous-time financial markets; tameness; stochastic flows.

State Tameness: A New Approach for Credit Constrains

We propose a new definition for tameness within the model of security prices as It\^o processes that is risk-aware. We give a new definition for arbitrage and characterize it. We then prove a theorem that can be seen as an extension of the second fundamental theorem of asset pricing, and a theorem for valuation of contingent claims of the American type. The valuation of European contingent claims and American contingent claims that we obtain does not require the full range of the volatility matrix. The technique used to prove the theorem on valuation of American contingent claims does not depend on the Doob-Meyer decomposition of super-martingales; its proof is constructive and suggest and alternative way to find approximations of stopping times that are close to optimal.arbitrage, pricing of contingent claims, continuous-time financial markets, tameness

PARAMETRIC ESTIMATION OF DIFFUSION PROCESSES SAMPLED AT FIRST EXIT TIME

This paper introduces a family of recursively defined estimators of the parameters of a diffusion process. We use ideas of stochastic algorithms for the construction of the estimators. Asymptotic consistency of these estimators and asymptotic normality of an appropriate normalization are proved. The results are applied to two examples from the financial literature; viz., Cox-Ingersoll-Ross' model and the constant elasticity of variance (CEV) process illustrate the use of the technique proposed herein.Continuous time Markov processes, discrete time sampling, diffusions, interest rate models, stochastic algorithms.

Trade & Cap: A Customer-Managed, Market-Based System for Trading Bandwidth Allowances at a Shared Link

We propose Trade & Cap (T&C), an economics-inspired mechanism that incentivizes users to voluntarily coordinate their consumption of the bandwidth of a shared resource (e.g., a DSLAM link) so as to converge on what they perceive to be an equitable allocation, while ensuring efficient resource utilization. Under T&C, rather than acting as an arbiter, an Internet Service Provider (ISP) acts as an enforcer of what the community of rational users sharing the resource decides is a fair allocation of that resource. Our T&C mechanism proceeds in two phases. In the first, software agents acting on behalf of users engage in a strategic trading game in which each user agent selfishly chooses bandwidth slots to reserve in support of primary, interactive network usage activities. In the second phase, each user is allowed to acquire additional bandwidth slots in support of presumed open-ended need for fluid bandwidth, catering to secondary applications. The acquisition of this fluid bandwidth is subject to the remaining "buying power" of each user and by prevalent "market prices" – both of which are determined by the results of the trading phase and a desirable aggregate cap on link utilization. We present analytical results that establish the underpinnings of our T&C mechanism, including game-theoretic results pertaining to the trading phase, and pricing of fluid bandwidth allocation pertaining to the capping phase. Using real network traces, we present extensive experimental results that demonstrate the benefits of our scheme, which we also show to be practical by highlighting the salient features of an efficient implementation architecture.National Science Foundation (CCF-0820138, CSR-0720604, EFRI-0735974, CNS-0524477, and CNS-0520166); Universidad Pontificia Bolivariana and COLCIENCIAS–Instituto Colombiano para el Desarrollo de la Ciencia y la Tecnología “Francisco Jose ́ de Caldas”

Collocation Games and Their Application to Distributed Resource Management

We introduce Collocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed systems in general, and in cloud computing environments in particular. Cloud computing enables fixed-capacity (processing, communication, and storage) resources to be offered by infrastructure providers as commodities for sale at a fixed cost in an open marketplace to independent, rational parties (players) interested in setting up their own applications over the Internet. Virtualization technologies enable the partitioning of such fixed-capacity resources so as to allow each player to dynamically acquire appropriate fractions of the resources for unencumbered use. In such a paradigm, the resource management problem reduces to that of partitioning the entire set of applications (players) into subsets, each of which is assigned to fixed-capacity cloud resources. If the infrastructure and the various applications are under a single administrative domain, this partitioning reduces to an optimization problem whose objective is to minimize the overall deployment cost. In a marketplace, in which the infrastructure provider is interested in maximizing its own profit, and in which each player is interested in minimizing its own cost, it should be evident that a global optimization is precisely the wrong framework. Rather, in this paper we use a game-theoretic framework in which the assignment of players to fixed-capacity resources is the outcome of a strategic "Collocation Game". Although we show that determining the existence of an equilibrium for collocation games in general is NP-hard, we present a number of simplified, practically-motivated variants of the collocation game for which we establish convergence to a Nash Equilibrium, and for which we derive convergence and price of anarchy bounds. In addition to these analytical results, we present an experimental evaluation of implementations of some of these variants for cloud infrastructures consisting of a collection of multidimensional resources of homogeneous or heterogeneous capacities. Experimental results using trace-driven simulations and synthetically generated datasets corroborate our analytical results and also illustrate how collocation games offer a feasible distributed resource management alternative for autonomic/self-organizing systems, in which the adoption of a global optimization approach (centralized or distributed) would be neither practical nor justifiable.NSF (CCF-0820138, CSR-0720604, EFRI-0735974, CNS-0524477, CNS-052016, CCR-0635102); Universidad Pontificia Bolivariana; COLCIENCIAS–Instituto Colombiano para el Desarrollo de la Ciencia y la Tecnología "Francisco José de Caldas

Guide for conducting research in applied linguistics

La investigación ha sido una de las áreas más importantes en educación; no solo contribuye a encontrar soluciones a los problemas educativos que surgen en la enseñanza y el aprendizaje, impactando así la realidad del contexto inmediato, sino que también valida la concepción de la resolución de problemas y el pensamiento crítico al desencadenar el desarrollo de hábitos de pensamiento lógico. Este proyecto trata sobre cómo llevar a cabo una investigación cualitativa a través de un manual que sirve como guía para investigadores novatos en el área de las ciencias sociales. Este manual surgió de la necesidad de guiar y capacitar a los estudiantes como un medio para diseñar sus propios proyectos de investigación sobre un tema de interés personal en el campo de la lingüística aplicada. Alternativamente, el manual también busca proporcionar herramientas que ayuden a los estudiantes a optimizar el tiempo aumentando el trabajo autónomo y minimizando la dependencia de otros profesores o investigadores. Por lo tanto, se abordan todas las secciones del proceso de investigación: desde el planteamiento del problema, las preguntas de investigación hasta la recopilación, análisis e interpretación de datos. En cada sección, el alumno novato encontrará en este texto la forma de estructurar la sección y el significado de la sección, las pautas para escribir la sección, consejos sobre qué evitar, consejos sobre qué considerar, así como una muestra en el final de cada sección. Esperamos que este manual ayude a un proyecto de investigación exitoso