Decision Making & Negotiations

The reorder point/reorder quantity policies, also referred to as (r, Q) policies, are widely used in industry and extensively studied in the literature. However, for a period of almost 30 years there has been no efficient algorithm for computing optimal control parameteres for such policies. In this paper, we present a surprisingly simple and efficient algorithm for the determination of an optimal (r*, Q*) policy. The computational complexity of the algorithm is linear in Q*.

A computer-based system for diagnosing bladder cancer is described. Typically, an object falls into one of two classes: Well or Not-well. The Well class contains the cells that will actually be useful for diagnosing bladder cancer; the Not-well class includes everything else. Several descriptive features are extracted from each object in the image and then fed to a multilayer perceptron, which classifies them as Well or Not-well. The perceptron's superior classification abilities reduces the number of computer misclassification errors to a level tolerable for clinical use.

When futures contracts are settled with respect to underlying asset prices, received theory suggests that the differences between futures prices and implied forward prices (from the term structure) are strictly due to marking to market, ceteris paribus. Empirical evidence appears to indicate that such differences are small for contracts with short maturities. What happens when the futures contract settles to yields implied by future prices of underlying assets?

The authors first attempt to clarify the affect terminology. Then, in an empirical study, they explore the affective reactions prompted by a wide range of consumption situations. For each of them, the authors investigate what preceeds, what happens during and what happens after the situation. 1,436 affective experiences, retrieved by 118 subjects in response to the proposed situations, were content-analyzed. The subjects reported more positive than negative affective reactions. These were essentially feelings, followed by evaluative affects.

This paper is concerned with the general dynamic lot size model, or (generalized) Wagner-Whitin model. Let n denote the number of periods into which the planning horizon is divided. We describe a simple forward algorithm which solves the general model in 0(n log n) time and 0(n) space, as opposed to the well-known shortest path algorithm advocated over the last 30 years with 0(n2) time.

In this paper we consider a class of single-server queueing systems with compound Poisson arrivals, in which, at service completion epochs, the server has the option of taking off for one or several vacations of random length. The cost structure consists of holding cost rate specified by a general non-decreasing function of the queue size, fixed costs for initiating and terminating service, and a variable operating cost incurred for each unit of time that the system is in operation.

Demandable-debt finance by banks warrants explanation because it entails costs of bank suspension, liquidation, and idle reserve holdings. An explanation is developed in which demandable debt provides incentive-compatible intermediation where the banker has comparative advantage in allocating investment funds but may act against the interests of uninformed depositors. Demandable debt attracts funds by giving depositors an option to force liquidation. Its usefulness in transacting follows from information-sharing between monitors and nonmonitors.