We design a dynamic rate scheduling policy of Markov type by using the solution (a social optimal Nash equilibrium point) to a utility-maximization problem over a randomly evolving capacity set for a ...
A choice model based on direct utility maximization subject to an arbitrary number of constraints is developed and applied to conjoint data. The model can accommodate both corner and interior ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback