We analyze dynamic assignment problems where agents successively receive different objects (positions, offices, etc.). A finite set of n vertically differentiated indivisible objects are assigned to n agents who live n periods. At each period, a new agent enters society, and the oldest agent...

This paper analyzes the assignment of durable objects to successive generations of agents who live for two periods. The optimal assignment rule is stationary, favors old agents and is determined by a selectivity function which satisfies an iterative functional differential equation. More patient...

There is very little research about how consumers of different races trust online marketing information from businesses or government when making expensive purchase decisions such as cancer treatment medicine. In this article, a large cross-cultural sample was surveyed to evaluate trust belief...

This paper proposes a frequency based transit assignment model that accounts for online information and strict capacity constraints. A heuristic is proposed to solve the problem, which first applies an unconstrained transit assignment procedure and then handles only the over-loaded transit line...