We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
In this paper we investigate principles of the representation of time and modality in terms of conceptual graphs. Based on the works of A. N. Prior, and C. S. Peirce, we suggest a ...
—We obtain detailed analytic formulas for the density and probability distribution of the waiting time in a time-division multiple-access (TDMA) model with a finite buffer and s...
Marcel F. Neuts, Jun Guo, Moshe Zukerman, Hai Le V...
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
A reward-based task typically consists of a mandatory part that must be accomplished before the given deadline, and an optional part that is associated with rewards for partial co...