This paper shows that the efficiency of relational contracting can be increased by reducing the public information through a novel intertemporalgarbling process of signals. A distinctive and essential feature of our intertemporalgarbling process is that past outputs have enduring effects on future signals. This process reduces the principal’s maximal reneging temptation by linking together the ...

A multi-class many-server system is considered, in which customers are served according to a non-preemptive priority policy and may renege while waiting to enter service. The service and reneging time distributions satisfy mild conditions. Building on an approach developed by Kaspi and Ramanan, the Law-of-Large-Numbers many-server asymptotics are characterized as the unique solution to a set of...

We use sample path arguments to derive convexity properties of an M/M/S queue with impatient customers that balk and renege. First, assuming that the balking probability and reneging rate are increasing and concave in the total number of customers in the system (head-count), we prove that the expected head-count is convex decreasing in the capacity (service rate). Second, with linear reneging a...

This paper investigates the performance of an integrated voice/data wireless mobile network where a finite buffer is provided for voice calls since they can endure a tolerable time, or the reneging time, for service. Based on a given humanistic reneging time, we analyze the voice traffic blocking probability. The probability distribution of receiving service within the reneging time is obtained...

This paper develops methods to compute performance measures in a specific type of loss system with multiple classes of customers sharing the same processor. Such systems arise in the modeling of a call center, where the performance measures of interest are blocking the probability of a call and the reneging probability of customers that are put on hold. Expressions for these performance measure...

This paper presents an analysis for an queueing system with customer behaviour, balking and reneging. Arriving customers balk with a probability and renege (leave the queue after entering) according to some distribution. Balking means that customers do not enter in the system, when queue is too long. Reneging means that a customer enter in the system, wait for some time and leave the system wit...

We present a novel theoretical mechanism that explains the capacity for non-enforceable communication about future actions to improve efficiency. We explore a two-player partnership game where, before choosing a level of effort to exert on a joint project, each player makes a cheap talk promise to their partner about their own future effort. We allow agents to incur a psychological cost of rene...

This article presents the analysis of a finite buffer M/M/1 queue with multiple and single working vacations. The arriving customers balk (that is do not join the queue) with a probability and renege (that is leave the queue after joining) according to exponential distribution. The inter-arrival times, service times during a regular service period, service times during a vacation period and vac...

While analyzing CAIDA Internet traces of TCP traffic to detect instances of data reneging, we frequently observed four misbehaviors in the generation of SACKs. These misbehaviors could result in the data sender mistakenly thinking data reneging occurred. Further testing detected two additional SACK generation misbehaviors which in the worst case could result in a data sender receiving a SACK fo...