Public Sector Strategies in Curbing Corruption: A Review of the Literature

Public Organization Review - Corruption is widespread and preventive strategies to reduce corruption need to be adapted within the local context. Considering the United Nations (UN) Convention...     

Compulsion mechanisms: state-movement dynamics in Buenos Aires

The article reveals and explains the workings of generally ignored mechanism of state–movement interaction proposed by Charles Tilly, namely the compulsion mechanism. Specifically, two types of compulsion mechanisms will be defined: compulsive support and compulsive control. In both types, without using physical repression, the state’s institutions reinforce the movement’s identity while also prompting it to adapt its repertoire of strategies to the state institutions’ requirements. Empirically, this article focuses on the interaction of the assembly movement with the state in the City of Buenos Aires. This movement emerged as a result of the socioeconomic and political crises of 2001–2002 in Argentina. Based on ethnographic fieldwork and archival research, the purpose is to unpack how the assembly movement’s identities and strategies were built and how its interaction with the state evolved.     

Structural learning and estimation of joint causal effects among network-dependent variables

Statistical Methods & Applications - Bayesian networks in the form of Directed Acyclic Graphs (DAGs) represent an effective tool for modeling and inferring dependence relations among variables,...     

Becoming a Culturally Responsive Special Educator Amidst School/University Partnerships: Teaching and Learning in Boundary-Zone Activity

This study presents an activity theory analysis of how special educators learn about culturally responsive practices amidst school–university partnerships. Particular attention was paid to how culturally responsive pedagogy was privileged and appropriated by an in-service and a pre-service teacher in a boundary-zone activity. Findings demonstrate how culturally responsive pedagogy was appropriated in light of previous pedagogical artifacts that preexisted in the activity system of the classroom and as a result it became a covert form of instructionism     

Building Factories Without Bosses: The Movement of Worker-Managed Factories in Argentina

In the 1990s and 2000s, Argentina suffered one of the quickest and most extreme processes of neoliberal state reforms in the world, leading to the closure of numerous factories. To resist the increased unemployment produced by neoliberalism, workers started to organize in a movement aimed at defending their only source of income: their labor. In this article, I analyze the main characteristics of the movement of worker-managed factories in Argentina by exploring how factories were occupied, what motivated the workers' decision to create co-operatives, what made the factories economically viable, how they were legitimated by the community, which legal reforms workers achieved to support their struggle, and how they manage their factories.     

Savage in the Market

We develop a behavioral axiomatic characterization of subjective expected utility (SEU) under risk aversion. Given is an individual agent's behavior in the market: assume a finite collection of asset purchases with corresponding prices. We show that such behavior satisfies a “revealed preference axiom” if and only if there exists a SEU model (a subjective probability over states and a concave utility function over money) that accounts for the given asset purchases.     

A pseudo-values regression model for non-fatal event free survival in the presence of semi-competing risks

Statistical Methods & Applications - During follow-up patients may experience non-fatal events related to disease progression and death. This is a “semi-competing risks” setting, as...     

Efficient algorithms for the max k -vertex cover problem

Given a graph  \(G(V,E)\) of order  \(n\) and a constant \(k \leqslant n\) , the max  \(k\) -vertex cover problem consists of determining  \(k\) vertices that cover the maximum number of edges in  \(G\) . In its (standard) parameterized version, max  \(k\) -vertex cover can be stated as follows: “given  \(G,\) \(k\) and parameter  \(\ell ,\) does  \(G\) contain  \(k\) vertices that cover at least  \(\ell \) edges?”. We first devise moderately exponential exact algorithms for max  \(k\) -vertex cover, with time-complexity exponential in  \(n\) but with polynomial space-complexity by developing a branch and reduce method based upon the measure-and-conquer technique. We then prove that, there exists an exact algorithm for max  \(k\) -vertex cover with complexity bounded above by the maximum among  \(c^k\) and  \(\gamma ^{\tau },\) for some \(\gamma < 2,\) where  \(\tau \) is the cardinality of a minimum vertex cover of  \(G\) (note that \({\textsc {max}}\,\) k \({\textsc {\!-vertex cover}}{} \notin \mathbf{FPT}\) with respect to parameter  \(k\) unless \(\mathbf{FPT} = \mathbf{W[1]}\) ), using polynomial space. We finally study approximation of max  \(k\) -vertex cover by moderately exponential algorithms. The general goal of the issue of moderately exponential approximation is to catch-up on polynomial inapproximability, by providing algorithms achieving, with worst-case running times importantly smaller than those needed for exact computation, approximation ratios unachievable in polynomial time.