Gubernatorial Veto in North Dakota

This study attempts to determine the extent that Dakota territorial and North Dakota State governors have exercised the gubernatorial veto. The approach is historical. The development of the gubernatorial veto is outlined, the state constitutional provisions concerning it are presented, and individual performances by governors are indicated. A more detailed account of the veto exercised by the current Governor, William L. Guy, is given. Dakota Territory was created with the governor having an absolute veto over acts of the legislature. Later Congress granted the legislature the power to override a veto. Ten territorial governors used the veto and a number of vetoes were overridden by the legislatures. The item veto was denied to territorial governors. When North Dakota became a State the governor was granted the full veto and an item veto over appropriation bills, subject to legislative overriding by a two-thirds roll call vote. Neither veto applied to initiated or referred measures. Later the governor was granted veto power:\u27over the State Industrial Commission. Evidence indicates that 523 vetoes have been issued by North Dakota governors. Only nineteen have been overridden by legislative action. One veto was sustained by court action. The veto has not been abused by any governor. A large number of vetoes have been in the public interest. It is recommended that governors be granted more time to study legislation, reduce items in appropriation bills, and be elected with the lieutenant governor as a team. Annual sessions of the legislature are also advocated

Universality of Load Balancing Schemes on Diffusion Scale

We consider a system of $N$ parallel queues with identical exponential service rates and a single dispatcher where tasks arrive as a Poisson process. When a task arrives, the dispatcher always assigns it to an idle server, if there is any, and to a server with the shortest queue among $d$ randomly selected servers otherwise $(1 \leq d \leq N)$. This load balancing scheme subsumes the so-called Join-the-Idle Queue (JIQ) policy $(d = 1)$ and the celebrated Join-the-Shortest Queue (JSQ) policy $(d = N)$ as two crucial special cases. We develop a stochastic coupling construction to obtain the diffusion limit of the queue process in the Halfin-Whitt heavy-traffic regime, and establish that it does not depend on the value of $d$, implying that assigning tasks to idle servers is sufficient for diffusion level optimality