A New Model for Designing a Product Line Using TURF Analysis

This paper introduces the approach of using TURF analysis to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.

The Simple Economics of Conglomeration with Bankruptcy Costs: Separate or Joint Financing?

Which projects should be financed through separate non-recourse loans (or limited- liability companies) and which should be bundled into a single loan? In the pres- ence of bankruptcy costs, this conglomeration decision trades off the benefit of co- insurance with the cost of risk contamination. This paper characterize this tradeoff for projects with binary returns, depending on the mean, variability, and skewness of returns, the bankruptcy recovery rate, the correlation across projects, the number of projects, and their heterogeneous characteristics. In some cases, separate financing dominates joint financing, even though it increases the interest rate or the probability of bankruptcy.

On prediction of individual sequences

Sequential randomized prediction of an arbitrary binary sequence isinvestigated. No assumption is made on the mechanism of generating the bit sequence. The goal of the predictor is to minimize its relative loss, i.e., to make (almost) as few mistakes as the best ``expert'' in a fixed, possibly infinite, set of experts. We point out a surprising connection between this prediction problem and empirical process theory. First, in the special case of static (memoryless) experts, we completely characterize the minimax relative loss in terms of the maximum of an associated Rademacher process. Then we show general upper and lower bounds on the minimaxrelative loss in terms of the geometry of the class of experts. As main examples, we determine the exact order of magnitude of the minimax relative loss for the class of autoregressive linear predictors and for the class of Markov experts.

A simple permutation test for clusteredness

Hierarchical clustering is a popular method for finding structure in multivariate data,resulting in a binary tree constructed on the particular objects of the study, usually samplingunits. The user faces the decision where to cut the binary tree in order to determine the numberof clusters to interpret and there are various ad hoc rules for arriving at a decision. A simplepermutation test is presented that diagnoses whether non-random levels of clustering are presentin the set of objects and, if so, indicates the specific level at which the tree can be cut. The test isvalidated against random matrices to verify the type I error probability and a power study isperformed on data sets with known clusteredness to study the type II error.

Stare decisis: Rhetoric and substance

Stare decisis allows common law to develop gradually and incrementally. We show howjudge-made law can steadily evolve and tend to increase efficiency even in the absence ofnew information. Judges' opinions must argue that their decisions are consistent withprecedent: this is the more costly, the greater the innovation they are introducing. As aresult, each judge effects a cautious marginal change in the law. Alternative models inwhich precedents are either strictly obeyed or totally discarded would instead predictabrupt large swings in legal rules. Thus we find that the evolution of case law isgrounded not in binary logic fixing judges' constraints, but in costly rhetoric shapingtheir incentives. We apply this finding to an assessment of the role of analogicalreasoning in shaping the joint development of different areas of law.

On payoff heterogeneity in games with strategic complementarities

Payoff heterogeneity weakens positive feedback in binary choice models intwo ways. First, heterogeneity drives individuals to corners where theyare unaffected by strategic complementarities. Second, aggregate behaviouris smoother than individual behaviour when individuals are heterogeneous.However, this smoothing does not necessarily eliminate positive feedbackor guarantee a unique equilibrium. In games with an unbounded, continuouschoice space, heterogeneity may either weaken or strengthen positive feedback,depending on a simple convexity/concavity condition. We conclude that positivefeedback phenomena derived in representative agent models will often be robustto heterogeneity.

Social preferences: Some simple tests and a new model

Departures from pure self interest in economic experiments have recently inspired models of "social preferences". We conduct experiments on simple two-person and three-person games with binary choices that test these theories more directly than the array of games conventionally considered. Our experiments show strong support for the prevalence of "quasi-maximin" preferences: People sacrifice to increase the payoffs for all recipients, but especially for the lowest-payoff recipients. People are also motivated by reciprocity: While people are reluctant to sacrifice to reciprocate good or bad behavior beyond what they would sacrifice for neutral parties, they withdraw willingness to sacrifice to achieve a fair outcome when others are themselves unwilling to sacrifice. Some participants are averse to getting different payoffs than others, but based on our experiments and reinterpretation of previous experiments we argue that behavior that has been presented as "difference aversion" in recent papers is actually a combination of reciprocal and quasi-maximin motivations. We formulate a model in which each player is willing to sacrifice to allocate the quasi-maximin allocation only to those players also believed to be pursuing the quasi-maximin allocation, and may sacrifice to punish unfair players.

A characterization of sequential rationalizability

A choice function is sequentially rationalizable if there is an ordered collection of asymmetric binary relations that identifies the selected alternative in every choice problem. We propose a property, F-consistency, and show that it characterizes the notion of sequential rationalizability. F-consistency is a testable property that highlights the behavioral aspects implicit in sequentially rationalizable choice. Further, our characterization result provides a novel tool with which to study how other behavioral concepts are related to sequential rationalizability, and establish a priori unexpected implications. In particular, we show that the concept of rationalizability by game trees, which, in principle, had little to do with sequential rationalizability, is a refinement of the latter. Every choice function that is rationalizable by a game tree is also sequentially rationalizable. Finally, we show that some prominent voting mechanisms are also sequentially rationalizable.

Relative payoffs and happiness: An experimental study

Some current utility models presume that people are concerned with their relative standing in a reference group. If this is true, do certain types care more about this than others? Using simple binary decisions and self-reported happiness, we investigate both the prevalence of ``difference aversion'' and whether happiness levels influence the taste for social comparisons. Our decision tasks distinguish between a person s desire to achieving the social optimum, equality or advantageous relative standing. Most people appear to disregard relative payoffs, instead typically making choices resulting in higher social payoffs. While we do not find a strong general correlation between happiness and concern for relative payoffs, we do observe that a willingness to lower another person s payoff below one s own (competitive preferences) seems correlated with unhappiness.

A simple randomized algorithm for consistent sequential prediction of ergodic time series

We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if thesequence is a realization of a stationary and ergodic random process then the average number of mistakes converges, almost surely, to that of the optimum, given by the Bayes predictor.

Conglomeration with bankruptcy costs: Separate or joint financing?

The paper analyzes the determinants of the optimal scope of incorporation in the presenceof bankruptcy costs. Bankruptcy costs alone generate a non-trivial tradeoff between thebenefit of coinsurance and the cost of risk contamination associated to joint financing corporate projects through debt. This tradeoff is characterized for projects with binary returns,depending on the distributional characteristics of returns (mean, variability, skewness, heterogeneity, correlation, and number of projects), the bankruptcy recovery rate, and the taxrate advantage of debt relative to equity. Our testable predictions are broadly consistentwith existing empirical evidence on conglomerate mergers, spin-offs, project finance, andsecuritization.

A data-dependent skeleton estimate and a scale-sensitive dimension for classification

The classical binary classification problem is investigatedwhen it is known in advance that the posterior probability function(or regression function) belongs to some class of functions. We introduceand analyze a method which effectively exploits this knowledge. The methodis based on minimizing the empirical risk over a carefully selected``skeleton'' of the class of regression functions. The skeleton is acovering of the class based on a data--dependent metric, especiallyfitted for classification. A new scale--sensitive dimension isintroduced which is more useful for the studied classification problemthan other, previously defined, dimension measures. This fact isdemonstrated by performance bounds for the skeleton estimate in termsof the new dimension.

Parallelizing remote sensing image geometric correction

Remote sensing spatial, spectral, and temporal resolutions of images, acquired over a reasonably sized image extent, result in imagery that can be processed to represent land cover over large areas with an amount of spatial detail that is very attractive for monitoring, management, and scienti c activities. With Moore's Law alive and well, more and more parallelism is introduced into all computing platforms, at all levels of integration and programming to achieve higher performance and energy e ciency. Being the geometric calibration process one of the most time consuming processes when using remote sensing images, the aim of this work is to accelerate this process by taking advantage of new computing architectures and technologies, specially focusing in exploiting computation over shared memory multi-threading hardware. A parallel implementation of the most time consuming process in the remote sensing geometric correction has been implemented using OpenMP directives. This work compares the performance of the original serial binary versus the parallelized implementation, using several multi-threaded modern CPU architectures, discussing about the approach to nd the optimum hardware for a cost-e ective execution.

Hints for a fast precessing relativistic radio jet in LS I+61·303

Here we discuss two consecutive MERLIN observations of the X-ray binary LS I +61◦303. The first observation shows a double-sided jet extending up to about 200 AU on both sides of a central source. The jet shows a bent S-shaped struct ure similar to the one displayed by the well-known precessing jet of SS 433. The precession suggested in the first MERLIN image becomes evident in the second one, showing a one-sided bent jet significantly rotated with respect to the jet of the day before. We conclude that the derived precession of the relativistic (β=0.6) jet explains puzzling previous VLBI results. Moreover , the fact that the precession is fast could be the explanation of the never understood short term (days) variability of the associated gamma-ray source 2CG 135 + 01 / 3EG J0241 + 6103.

VLA multifrequency observations of RSCVn binaries

We present multiepoch Very Large Array (VLA) observations at 1.4 GHz, 4.9 GHz, 8.5 GHz and 14.9 GHz for a sample of eight RS CVn binary systems. Circular polarization measurements of these systems are also reported. Most of the fluxes observed are consistent with incoherent emission from mildly relativistic electrons. Several systems show an increase of the degree of circular polarization with increasing frequency in the optically thin regime, in conflict with predictions by gyrosynchrotron models. We observed a reversal in the sense of circular polarization with increasing frequency in three non-eclipsing systems: EI Eri, DM Uma and HD 8358. We find clear evidence for coherent plasma emission at 1.4 GHz in the quiescent spectrum of HD 8358 during the helicity reversal. The degrees of polarization of the other two systems could also be accounted for by a coherent emission process. The observations of ER Vul revealed two U-shaped flux spectra at the highest frequencies. The U-shape of the spectra may be accounted for by an optically thin gyrosynchrotron source for the low frequency part whereas the high frequency part is dominated by a thermal emission component.