Abstracted primal-dual affine programming

The classical study of linear programs, pioneered by George Dantzig and Albert Tucker, studies both the theory, and methods of solutions for a linear primal-dual maximization-minimization program

Bayesian Analysis of Consumer Choices with Taste, Context, Reference Point and Individual Scale Effects

This paper adopts an approach based on the concepts of random utility maximization and builds on the general theoretical framework of Lancaster and on the conceptual and econometric innovations of McFadden. Recent research in this area explores models that account for context effects, as well as methods for characterizing heterogeneity, response variability and decision strategy selection by consumers. This makes it possible to construct much richer empirical models of individual consumer behavior. A Bayesian approach provides a useful way to estimate and interpret models that are difficult to accomplish by conventional maximization/minimization algorithms. The application reported in the paper involves analysis of reference dependence and product labeling as context effects and the assessment of heterogeneity and response variability.Consumer/Household Economics,

On Bounds for Concave Distortion Risk Measures for Sums of Risks

In this paper we consider the problem of studying the gap between bounds of risk measures for sums of non-independent random variables. Owing to the choice of the context where to set the problem, namely that of distortion risk measures, we first deduce an explicit formula for the risk measure of a discrete risk by referring to its writing as sum of layers. Then, we examine the case of sums of discrete risks with identical distribution. Upper and lower bounds for risk measures of sums of risks are presented in the case of concave distortion functions. Finally, the attention is devoted to the analysis of the gap between risk measures of upper and lower bounds, with the aim of optimizing it.Distortion risk measures, discrete risks, concave risk measure, upper and lower bounds, gap between bounds

Task allocation in a distributed computing system

A conceptual framework is examined for task allocation in distributed systems. Application and computing system parameters critical to task allocation decision processes are discussed. Task allocation techniques are addressed which focus on achieving a balance in the load distribution among the system's processors. Equalization of computing load among the processing elements is the goal. Examples of system performance are presented for specific applications. Both static and dynamic allocation of tasks are considered and system performance is evaluated using different task allocation methodologies

Linear Programming by Solving Systems of Differential Equations Using Game Theory

In this paper we will solve some linear programming problems by solving systems of differential equations using game theory. The linear programming problem must be a classical constraints problem or a classical menu problem, i.e. a maximization/minimization problem in the canonical form with all the coefficients (from objective function, constraints matrix and right sides) positive. Firstly we will transform the linear programming problem such that the new problem and its dual have to be solved in order to find the Nash equilibrium of a matriceal game. Next we find the Nash equilibrium by solving a system of differential equations as we know from evolutionary game theory, and we express the solution of the obtained linear programming problem (by the above transformation of the initial problem) using the Nash equilibrium and the corresponding mixed optimal strategies. Finally, we transform the solution of the obtained problem to obtain the solution of the initial problem. We make also a program to implement the algorithm presented in the paper.Linear programming, evolutionary game theory, Nash equilibrium.

Unsupervised Learning for Monaural Source Separation Using Maximization–Minimization Algorithm with Time–Frequency Deconvolution

This paper presents an unsupervised learning algorithm for sparse nonnegative matrix factor time–frequency deconvolution with optimized fractional β -divergence. The β -divergence is a group of cost functions parametrized by a single parameter β . The Itakura–Saito divergence, Kullback–Leibler divergence and Least Square distance are special cases that correspond to β=0, 1, 2 , respectively. This paper presents a generalized algorithm that uses a flexible range of β that includes fractional values. It describes a maximization–minimization (MM) algorithm leading to the development of a fast convergence multiplicative update algorithm with guaranteed convergence. The proposed model operates in the time–frequency domain and decomposes an information-bearing matrix into two-dimensional deconvolution of factor matrices that represent the spectral dictionary and temporal codes. The deconvolution process has been optimized to yield sparse temporal codes through maximizing the likelihood of the observations. The paper also presents a method to estimate the fractional β value. The method is demonstrated on separating audio mixtures recorded from a single channel. The paper shows that the extraction of the spectral dictionary and temporal codes is significantly more efficient by using the proposed algorithm and subsequently leads to better source separation performance. Experimental tests and comparisons with other factorization methods have been conducted to verify its efficacy