Union Formation and Bargaining Rules in the Labor Market

This paper analyzes union formation in a model of bargaining between a firm and several unions. We address two questions: first, the optimal configuration of unions (their number and size) and, second, the impact of the bargaining pattern (simultaneous or sequential). For workers, grouping into several unions works as a price discrimination device which, at the same time, decreases their market power. The analysis shows that optimal union configuration depends on the rules that regulate the bargaining process (monopoly union, Nash bargaining or right to manage).union formation, sequential bargaining, nash bargaining, monopoly union

Faster Multidimensional Data Queries on Infrastructure Monitoring Systems

The analytics in online performance monitoring systems have often been limited due to the query performance of large scale multidimensional data. In this paper, we introduce a faster query approach using the bit-sliced index (BSI). Our study covers multidimensional grouping and preference top-k queries with the BSI, algorithms design, time complexity evaluation, and the query time comparison on a real-time production performance monitoring system. Our research work extended the BSI algorithms to cover attributes filtering and multidimensional grouping. We evaluated the query time with the single attribute, multiple attributes, feature filtering, and multidimensional grouping. To compare with the existing prior arts, we made a benchmarking comparison with the bitmap indexing, sequential scan, and collection streaming grouping. In the result of our experiments with large scale production data, the proposed BSI approach outperforms the existing prior arts: 3 times faster than the bitmap indexing approach on single attribute top-k queries, 10 times faster than the collection stream approach on the multidimensional grouping. While comparing with the baseline sequential scan approach, our proposed algorithm BSI approach outperforms the sequential scan approach with a factor of 10 on multiple attributes queries and a factor of 100 on single attribute queries. In the previous research, we had evaluated the BSI time complexity and space complexity on simulation data with various distributions, this research work further studied, evaluated, and concluded the BSI approach query performance with real production data

Penalized Orthogonal-Components Regression for Large p Small n Data

We propose a penalized orthogonal-components regression (POCRE) for large p small n data. Orthogonal components are sequentially constructed to maximize, upon standardization, their correlation to the response residuals. A new penalization framework, implemented via empirical Bayes thresholding, is presented to effectively identify sparse predictors of each component. POCRE is computationally efficient owing to its sequential construction of leading sparse principal components. In addition, such construction offers other properties such as grouping highly correlated predictors and allowing for collinear or nearly collinear predictors. With multivariate responses, POCRE can construct common components and thus build up latent-variable models for large p small n data.Comment: 12 page

Penalized Orthogonal-Components Regression for Large p Small n Data

We propose a penalized orthogonal-components regression (POCRE) for large p small n data. Orthogonal components are sequentially constructed to maximize, upon standardization, their correlation to the response residuals. A new penalization framework, implemented via empirical Bayes thresholding, is presented to effectively identify sparse predictors of each component. POCRE is computationally efficient owing to its sequential construction of leading sparse principal components. In addition, such construction offers other properties such as grouping highly correlated predictors and allowing for collinear or nearly collinear predictors. With multivariate responses, POCRE can construct common components and thus build up latent-variable models for large p small n data.Comment: 12 page

Neural Expectation Maximization

Many real world tasks such as reasoning and physical interaction require identification and manipulation of conceptual entities. A first step towards solving these tasks is the automated discovery of distributed symbol-like representations. In this paper, we explicitly formalize this problem as inference in a spatial mixture model where each component is parametrized by a neural network. Based on the Expectation Maximization framework we then derive a differentiable clustering method that simultaneously learns how to group and represent individual entities. We evaluate our method on the (sequential) perceptual grouping task and find that it is able to accurately recover the constituent objects. We demonstrate that the learned representations are useful for next-step prediction.Comment: Accepted to NIPS 201

Beamspace Aware Adaptive Channel Estimation for Single-Carrier Time-varying Massive MIMO Channels

In this paper, the problem of sequential beam construction and adaptive channel estimation based on reduced rank (RR) Kalman filtering for frequency-selective massive multiple-input multiple-output (MIMO) systems employing single-carrier (SC) in time division duplex (TDD) mode are considered. In two-stage beamforming, a new algorithm for statistical pre-beamformer design is proposed for spatially correlated time-varying wideband MIMO channels under the assumption that the channel is a stationary Gauss-Markov random process. The proposed algorithm yields a nearly optimal pre-beamformer whose beam pattern is designed sequentially with low complexity by taking the user-grouping into account, and exploiting the properties of Kalman filtering and associated prediction error covariance matrices. The resulting design, based on the second order statistical properties of the channel, generates beamspace on which the RR Kalman estimator can be realized as accurately as possible. It is observed that the adaptive channel estimation technique together with the proposed sequential beamspace construction shows remarkable robustness to the pilot interference. This comes with significant reduction in both pilot overhead and dimension of the pre-beamformer lowering both hardware complexity and power consumption.Comment: 7 pages, 3 figures, accepted by IEEE ICC 2017 Wireless Communications Symposiu