Consumer Behavior

We examine a multi-server queueing system with Poisson arrivals in which customers require simultaneous service from a random number of servers. Servers assigned to the same customer begin and end service concurrently. Service times are, in general, assumed to be exponentially distributed. A system point approach is presented as a framework for obtaining the waiting time distribution for each customer type. Explicit solutions are derived for the two-server system.

We establish sufficient conditions for the recoverability and uniqueness of utility functions (preferences) generating consumption and asset demands in a two-period setting under uncertainty.

This paper establishes the existence of a solution to the optimality equations in undiscounted semi-Markov decision models with countable state space, under conditions generalizing the hitherto obtained results. In particular, we merely require the existence of a finite set of states in which every pair of states can reach each other via some stationary policy, instead of the traditional and restrictive assumption that ever stationary policy has a single irreducible set of states.

The article focuses on the authors' comments on marketing of consumer information. Authors are somewhat distressed as their original article was severely misinterpreted by researcher Dan Sarel. Two main criticisms of the authors' model and methodology offered by Sarel are that the methodology cannot produce useful guidelines for three reasons: the criteria used in the methodology are inappropriate, the product is of a special nature and other important considerations have been omitted.

This paper presents methods for solving allocation problems that can be stated as convex knapsack problems with generalized upper bounds. Such bounds may express upper limits on the total amount allocated to each of several subsets of activities. In addition our model arises as a subproblem in more complex mathematical programs. We therefore emphasize efficient procedures to recover optimality when minor changes in the parameters occur from one problem instance to the next. These considerations lead us to propose novel data structures for such problems.

In continuous review models with a fixed delivery lag T, the state of the system is conveniently described by the net inventory position = (inventory on hand) plus (outstanding orders), in spite of most cost components depending on the actual inventory on hand. To relate these two inventory concepts one observes that the distribution of the inventory on hand at time t + T is determined by the inventory position at time t.

The article focuses on the author's view on whether consumers can calculate best buys. According to the author, a number of studies have found only a limited incidence of the ability to reason proportionately. Though subjects in these studies were still in their teens, little further development would be probable with their advancement into adulthood. This evidence led to their hypothesis that a significant number of adults would be unable to utilize a proportional reasoning strategy in a simple consumer decision-making context.

This paper considers the solution of Markov decision problems whose parameters can be obtained only via approximating schemes, or where it is computationally preferable to approximate the parameters, rather than employing exact algorithms for their computation. Various models are presented in which this situation occurs. Furthermore, it is shown that a modified value-iteration method may be employed, both for the discounted version and for the undiscounted version of the model, in order to solve the optimality equation and to find optimal policies.