Consumer Behavior

This article focuses on the formulation of a method to solve the joint consumption-portfolio problem. The formulation presented allows the author to distinguish between risk preferences and time preferences when determining optimal consumption and asset demand. Classic Fisherian two-period diagrammatics are generalized. Period-two risk preferences are assumed to be independent of first-period consumption. The set of consumption-portfolio optima is expanded consistently with utility maximization.

This paper presents a simple and computationally tractable method which recursively computes the stationary probabilities of the queue size in an M/G/1 queueing system with variable service rate. For each service two possible service types are available and the service rule is characterized by two switch-over levels. The computational approach discussed in this paper can be applied to a variety of queueing problems.

This paper considers undiscounted two-person, zero-sum sequential games with finite state and action spaces. Under conditions that guarantee the existence of stationary optimal strategies, we present two successive approximation methods for finding the optimal gain rate, a solution to the optimality equation, and for any ϵ > 0, ϵ-optimal policies for both players.

We consider a multiserver queueing system in which customers request service from a random number of identical servers. In contrast to batch arrival queues, customers cannot begin service until all required servers are available. Servers assigned to the same customer may free separately. For this model, we derive the steady-state distribution for waiting time, the distribution of busy servers, and other important measures. Sufficient conditions for the existence of a steady-state distribution are also obtained.

This paper establishes a rather complete optimality theory for the average cost semi-Markov decision model with a denumerable state space, compact metric action sets and unbounded one-step costs for the case where the underlying Markov chains have a single ergotic set.

This paper considers undiscounted Markov decision problems. With no restriction (on either the periodicity or chain structure of the problem) we show that the value iteration method for finding maximal gain policies exhibits a geometric rate of convergence, whenever convergence occurs. In addition, we study the behaviour of the value-iteration operator; we give bounds for the number of steps needed for contraction, describe the ultimate behaviour of the convergence factor and give conditions for the existence of a uniform convergence rate.

Consumer information programs can be more effective if they are conceived within a marketing framework which views consumer information as a product to be marketed. A methodology is outlined which can assist consumer information program developers in identifying information needs from the consumer's point of view, rather than the policy maker's.

A survey is given of the present state of the art of value-iteration and related successive approximation methods, as well as of resulting turnpike properties, in both the discounted and undiscounted version of finite state and action Markov Decision Problems.

This paper is concerned with the effects of capital risk on optimal individual savings decisions in a simple two-period setting. We investigate the respective roles played by risk and time preferences in answering the following related questions: Q1: Will savings increase, remain constant or decrease in response to an increase in capital risk? Q2: Is optimal saving in the presence of capital risk greater than, equal to or less than optimal saving in the certainty case where the rate of return equals the mean (uncertain) return?