Legislative Organization and Administrative Redundancy

Congress regularly enacts legislation providing for redundant administrative programs. For example, there are more than 100 federal programs for surface transportation, 82 programs to ensure teacher quality, 80 programs to promote domestic economic development, and 47 programs to provide employment and job-training services. Recent high-profile legislation–-such as the financial-industry reform measure and the health-care reform measure–-add new programs without repealing existing ones directed at the same policy goals. Prior academic analyses generally have not considered why Congress pursues redundancy. This article addresses that question through both theoretical and institutional analysis. The article first constructs an organizational theory that attributes redundancy in administrative programs to the congressional committee system. Specifically, the article demonstrates that two critical components of the existing committee system-–fragmented jurisdictions and parliamentary prerogatives–-systematically bias legislative outcomes in favor of redundancy. Building on leading theoretical accounts of congressional committees from political science, the article then presents a novel cost-benefit analysis of this tendency toward redundancy. It shows that redundancy allows legislators to increase distributive favors for constituents and interest groups but that redundancy is also linked to the desirable pursuit of informational efficiency. Thus, the institutional structures facilitating redundancy have mixed effects. Consequently, the article describes and analyzes specific institutional reforms that trade off the distributive costs and the informational benefits associated with redundancy. One approach would subject more legislative decisions to external advisory processes such as that used to close unneeded military facilities. A second and more promising approach would preserve existing committee jurisdictions but would scale back committees’ parliamentary prerogatives, thereby encouraging redundancy in program design but discouraging redundancy in program implementation

Multiscale Information Decomposition: Exact Computation for Multivariate Gaussian Processes

Exploiting the theory of state space models, we derive the exact expressions of the information transfer, as well as redundant and synergistic transfer, for coupled Gaussian processes observed at multiple temporal scales. All of the terms, constituting the frameworks known as interaction information decomposition and partial information decomposition, can thus be analytically obtained for different time scales from the parameters of the VAR model that fits the processes. We report the application of the proposed methodology firstly to benchmark Gaussian systems, showing that this class of systems may generate patterns of information decomposition characterized by mainly redundant or synergistic information transfer persisting across multiple time scales or even by the alternating prevalence of redundant and synergistic source interaction depending on the time scale. Then, we apply our method to an important topic in neuroscience, i.e., the detection of causal interactions in human epilepsy networks, for which we show the relevance of partial information decomposition to the detection of multiscale information transfer spreading from the seizure onset zone

Redundancy Scheduling with Locally Stable Compatibility Graphs

Redundancy scheduling is a popular concept to improve performance in parallel-server systems. In the baseline scenario any job can be handled equally well by any server, and is replicated to a fixed number of servers selected uniformly at random. Quite often however, there may be heterogeneity in job characteristics or server capabilities, and jobs can only be replicated to specific servers because of affinity relations or compatibility constraints. In order to capture such situations, we consider a scenario where jobs of various types are replicated to different subsets of servers as prescribed by a general compatibility graph. We exploit a product-form stationary distribution and weak local stability conditions to establish a state space collapse in heavy traffic. In this limiting regime, the parallel-server system with graph-based redundancy scheduling operates as a multi-class single-server system, achieving full resource pooling and exhibiting strong insensitivity to the underlying compatibility constraints.Comment: 28 pages, 4 figure