20 research outputs found
Corporate philanthropy and corporate financial performance: The roles of social response and political access
Corporate philanthropy is expected to positively affect firm financial performance because it helps firms gain sociopolitical legitimacy, which enables them to elicit positive stakeholder responses and to gain political access. The positive philanthropy-performance relationship is stronger for firms with greater public visibility and for those with better past performance, as philanthropy by these firms gains more positive stakeholder responses. Firms that are not government-owned or politically well connected were shown to benefit more from philanthropy, as gaining political resources is more critical for such firms. Empirical analyses using data on Chinese firms listed on stock exchanges from 2001 to 2006 support these arguments
Business social norms from overseas and corporate social responsibility performance: evidence from China
ELECTROKINETIC SOIL PROCESSING COMPLICATING FEATURES OF ELECTROKINETIC REMEDIATION OF SOILS AND SLURRIES: SATURATION EFFECTS AND THE ROLE OF THE CATHODE ELECTROLYSIS.
Dual domination
Inspired by the feedback scenario, which characterizes online social networks, we introduce a novel domination problem, which we call Dual Domination (DD). We assume that the nodes in the input network are partitioned into two categories: Positive nodes (V+) and negative nodes (V-). We are looking for a set D ⊆ V+ that dominates the largest number of positive nodes while avoiding as many negative nodes as possible. In particular, we study the Maximum Bounded Dual Domination (MBDD) problem, where given a bound k, the problem is to find a set D ⊆ V+, which maximizes the number of nodes dominated in V+ dominating at most k nodes in V- We show that the MBDD problem is hard to approximate to a factor better than (1 − 1/e). We give a polynomial time approximation algorithm with approximation guaranteed (1 − e−1/Δ), where Δ represents the maximum number of neighbors in V+ of any node in V- Furthermore, we give an O(|V|k2) time algorithm to solve the problem on trees