Given a complete graph G=(V,E), a weight function on its edges, and a penalty function on its vertices, the penalized k-min-sum problem is the problem of finding a partition of V to k+1 sets, S1,...,Sk+1, minimizing , where for , and p(S)=[summation operator]i[set membership, variant]Spi. Our...

We consider an individual's choice whether to be evaluated. Separating signaling equilibria can arise when individuals are risk averse, even if the cost of evaluation is zero for all.

Relative priorities in an n-class queueing system can reduce server and customer costs. This property is demonstrated in a single server Markovian model where the goal is to minimize a non-linear cost function of class expected waiting times. Special attention is given to minimizing server's...

The following example illustrates the problem treated in this paper: Two gas stations are located one after the other on a main road. A driver who needs to fill his rank sees the queue situation at the first station but not at the second one. The driver estimates the expected waiting time at the...

Queueing systems with scheduled arrivals, i.e., appointment systems, are typical for frontal service systems, e.g., health clinics. An aspect of customer behavior that influences the overall efficiency of such systems is the phenomenon of no-shows. The consequences of no-shows cannot be...