Decision Making & Negotiations

We analyze a continuous-time, two-stage production/inventory system. In the first stage, a common intermediate product is produced in batches, and possibly stored. In the second phase, the intermediate product is fabricated into n distinct finished products. Several finished products may be included in a single production batch of limited capacity to exploit economies of scale. We propose a planning methodology to address the combined problem of joint setup costs and capacity limits (per setup).

In many important combinatorial optimization problems, such as bin packing, allocating customer classes to queueing facilities, vehicle routing, multi-item inventory replenishment and combined routing/inventory control, an optimal partition into groups needs to be determined for a finite collection of objects; each is characterized by a single attribute. The cost is often separable in the groups and the group cost often depends on the cardinality and some aggregate measure of the attributes, such as the sum or the maximum element.

We empirically explore the accuracy of an easily computed approximation for long run, average performance measures such as expected delay and probability of delay in multiserver queueing systems with exponential service times and periodic (sinusoidal) Poisson arrival processes. The pointwise stationary approximation is computed by integrating over time (that is taking the expectation of) the formula for the stationary performance measure with the arrival rate that applies at each point in time.

We examine the effects of nonstationarity on the performance of multiserver queueing systems withe exponential service times and sinusoidal Poisson input streams. Our primary objective is to determine when and how a stationary model may be used as an approximation for a nonstationary system. We focus on a particular quesion: How nonstationary can an arrival process be before a simple stationary approximation fails? Our analysis reveals that stationary models can seriously underestimate delays when the actual system is only modestly nonstationary.

Observers viewed random-dot optical flow displays that simulated self-motion on a circular path and judged whether they would pass to the right or left of a target at 16 m. Two dots in 2 frames are theoretically sufficient to specify circular heading if the orientation of the rotation axis is known. Heading accuracies were better than 1.5° with a ground surface, wall surface, and 3-dimensional cloud of dots and were constant over densities down to 2 dots, consistent with the theory.

Focusing on asset returns governed by a factor structure, the APT is a one-period model, in which preclusion of arbitrage over static portfolios of these assets leads to a linear relation between the expected return and its covariance with the factors. The APT, however, does not preclude arbitrage over dynamic portfolios. Consequently, applying the model to evaluate managed portfolios contradicts the no-arbitrage spirit of the model.

A number of issues that relate to the desirability and implications of new venture financing are examined within a principal-agent framework that captures the essence of the relationship between entrepreneurs and venture capitalists. The model suggests: (1) As long as the skill levels of entrepreneurs are common knowledge, all will choose to involve venture capital investors, since the risk sharing provided by outside participation dominates the agency relationship that is created.

Similarity scaling often requires subjects to produce such a large number of judgments that fatigue may become a problem. Yet it remains unclear just how respondent fatigue affects similarity perceptions and resulting judgments. The present study uses a categorization perspective to examine the effects of fatigue on similarity judgments. The results suggest that subjects rely increasingly on category membership as they progress through a similarity judgment task.

We argue that although decentralization has advantages in finding low-cost solutions, these advantages are accompanied by coordination problems, which lead to delay or duplication of effort or both. Consequently, decentralization is desirable when there is little urgency or a great deal of private information, but it is strictly undesirable in urgent problems when private information is less important. We also examine the effect of large numbers and find that coordination problems disappear in the limit if distributions are common knowledge.