This note shows that the optimal choice of k simultaneous experiments in a stationary multi-armed bandit problem can be characterized in terms of the Gittins index of each arm. The index characterization remains equally valid after the introduction of switching costs.

The greedy heuristic may be used to obtain approximate solutions to integer programming problems. For some classes of problems, notably knapsack problems related to the coin changing problem, the greedy heuristic results in optimal solutions. However, the greedy heuristic does quite poorly at...

Commodity bundling is studied in an environment where the dispersion of valuations unambiguously decreases when two or more goods are sold as a bundle only. Bundling is more likely to dominate separately selling the goods if marginal costs are low relative to the average valuation, or if the...

This paper considers the problem of choosing the number bootstrap repetitions B to use with the BC_{a} bootstrap confidence intervals introduced by Efron (1987). Because the simulated random variables are ancillary, we seek a choice of B that yields a confidence interval that is close to the...

A new model of near integration is formulated in which the local to unity parameter is identifiable and consistently estimable with time series data. The properties of the model are investigated, new functional laws for near integrated time series are obtained, and consistent estimators of the...

General equilibrium is timeless, and without outside money, the price system is homogeneous of order zero. Some finite horizon strategic market game models are considered with an initial issue of flat money held as an asset. For any arbitrary finite horizon, the solution is time-dependent. In...