Communities, Co-ops, and Clubs: Social Capital and Incentives in Large Collective Organizations

2021 ◽  
Vol 13 (3) ◽  
pp. 29-69
Author(s):  
Joshua A. Jacobs ◽  
Aaron M. Kolb ◽  
Curtis R. Taylor
Keyword(s):  
Social Capital ◽  
Steady State ◽  
Continuous Time ◽  
Design Problem ◽  
Poor Performance ◽  
Organization Design ◽  
Steady State Distribution ◽  
State Distribution ◽  
Performance Tracking ◽  
Monetary Transfers

We study a continuous-time organization design problem. Each member’s output is an imperfect signal of his underlying effort, and each member’s utility from remaining in the organization is endogenous to other members’ efforts. Monetary transfers are assumed infeasible. Incentives can be provided only through two channels: expulsion following poor performance and respite following good performance. We derive the steady state distribution of members’ continuation utilities for arbitrary values of the initial and maximum continuation utilities and then optimize these values according to organizational objectives. An optimally designed organization can be implemented by associating continuation utilities with a performance-tracking reputation system. (JEL Z13, D23, D86, P13, D82)

ON THE STEADY-STATE DISTRIBUTION OF NUMBER IN THE QUEUE Geom/G/1

1999 ◽  
Vol 13 (1) ◽  
pp. 121-125 ◽  
Author(s):  
M. L. Chaudhry
Keyword(s):  
Steady State ◽  
Discrete Time ◽  
Continuous Time ◽  
Telecommunication Networks ◽  
Steady State Distribution ◽  
State Distribution ◽  
Discrete Time Systems ◽  
Discrete Time Queues ◽  
Time Queues ◽  
Time Systems

Discrete-time queues are frequently used in telecommunication networks. This paper proposes a new method which is based only on probabilistic arguments. It derives the distributions of numbers of customers in the discrete-time systems Geom/G/1 and Geom/G/1/M. Though the derivation does not involve use of the transforms, the transforms may be obtained, if desired. Another advantage of this is that the numerical results obtained are stable as there are no negative signs involved in summations. Further, the method can be easily used to solve more complex problems in discrete- and continuous-time queues.

Kinetic analysis of mechanism of intestinal Na+-dependent sugar transport

1985 ◽  
Vol 248 (5) ◽  
pp. C498-C509 ◽  
Author(s):  
D. Restrepo ◽  
G. A. Kimmich
Keyword(s):  
Experimental Data ◽  
Steady State ◽  
Sugar Transport ◽  
Enzyme Kinetic ◽  
Steady State Distribution ◽  
State Distribution ◽  
Least Squares Fit ◽  
Coupling Stoichiometry ◽  
Rate Limiting ◽  
Kinetics Of

Zero-trans kinetics of Na+-sugar cotransport were investigated. Sugar influx was measured at various sodium and sugar concentrations in K+-loaded cells treated with rotenone and valinomycin. Sugar influx follows Michaelis-Menten kinetics as a function of sugar concentration but not as a function of Na+ concentration. Nine models with 1:1 or 2:1 sodium:sugar stoichiometry were considered. The flux equations for these models were solved assuming steady-state distribution of carrier forms and that translocation across the membrane is rate limiting. Classical enzyme kinetic methods and a least-squares fit of flux equations to the experimental data were used to assess the fit of the different models. Four models can be discarded on this basis. Of the remaining models, we discard two on the basis of the trans sodium dependence and the coupling stoichiometry [G. A. Kimmich and J. Randles, Am. J. Physiol. 247 (Cell Physiol. 16): C74-C82, 1984]. The remaining models are terter ordered mechanisms with sodium debinding first at the trans side. If transfer across the membrane is rate limiting, the binding order can be determined to be sodium:sugar:sodium.

PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION

2017 ◽  
Vol 31 (4) ◽  
pp. 420-435 ◽  
Author(s):  
J.-M. Fourneau ◽  
Y. Ait El Majhoub
Keyword(s):  
Steady State ◽  
Product Form ◽  
Processor Sharing ◽  
Service Capacity ◽  
Steady State Distribution ◽  
State Distribution ◽  
Signal Arrival ◽  
Open Networks ◽  
Networks Of Queues

We consider open networks of queues with Processor-Sharing discipline and signals. The signals deletes all the customers present in the queues and vanish instantaneously. The customers may be usual customers or inert customers. Inert customers do not receive service but the servers still try to share the service capacity between all the customers (inert or usual). Thus a part of the service capacity is wasted. We prove that such a model has a product-form steady-state distribution when the signal arrival rates are positive.

Sign in / Sign up

Export Citation Format

Share Document