Coordination complexes of acetylenic phosphines and diphosphines : V. Acetylene bridged derivatives of dicobalt octacarbonyl

Reactions of the phosphinoacetylenes RR′PCCR″ (R  R′  Ph, R″  H, CF₃, Ph, Me, t-Bu; R  R′  C₆F₅, R″  Ph, Me; R  Ph, R′  Me, R″  Me) with Co₂(CO)₈ have been studied. Complexes of four types have been characterised: (A)(RR′PC₂R″)CO₂(CO)₆ (R  R′  C₆F₅, R″  Ph, Me; R  R′  Ph, R″  t-Bu), (B) (RR′PC₂R″)₂Co₄(CO)₁₀ (R  R′  Ph, R″  H, CF₃, Ph, Me; R  R′  C₆F₅, R″  Me; R  Ph, R′  Me, R″  Me), (C) (RR′PC₂R″)₂Co₂(CO)₆ (R  R′  Ph, R″  t-Bu), (D) (RR′P(O)C₂R″)Co₂(CO)₆ (R  R′  Ph, R″  t-Bu; R  R′  C₆F₅, R  Ph). The complexes were characterised by microanalysis, IR, NMR and where possible mass spectra. Substitution reactions of the complexes with tertiary phosphites are described. In complexes of type (A) only the alkyne function is utilised whereas the tetranuclear compounds (B) have structures in which both alkyne and phosphorus moieties are coordinated. Compounds of type (C) are simple disubstituted phosphine complexes of Co₂(CO)₈ and those of type (D) are μ-alkyne derivatives of acetylenic phosphine oxides. The mechanism of formation of complexes of type (B) is discussed in the light of IR data.     

Two-carrier conduction in Rb-TCNQ-II

Single crystal electrical resistivity and thermoelectric power (TEP) measurements as a function of temperature are repotted in Rb-TCNQ-II. Results suggest intrinsic conductivity by holes above 360 K with an activation energy of 0.44 eV. Below room temperature conductivity is extrinsic and is due to donors located 0.18 eV below the conduction band.     

Equilibrium strategies for multiple interdictors on a common network

In this work, we introduce multi-interdictor games, which model interactions among multiple interdictors with differing objectives operating on a common network. As a starting point, we focus on shortest path multi-interdictor (SPMI) games, where multiple interdictors try to increase the shortest path lengths of their own adversaries attempting to traverse a common network. We first establish results regarding the existence of equilibria for SPMI games under both discrete and continuous interdiction strategies. To compute such an equilibrium, we present a reformulation of the SPMI game, which leads to a generalized Nash equilibrium problem (GNEP) with non-shared constraints. While such a problem is computationally challenging in general, we show that under continuous interdiction actions, an SPMI game can be formulated as a linear complementarity problem and solved by Lemke’s algorithm. In addition, we present decentralized heuristic algorithms based on best response dynamics for games under both continuous and discrete interdiction strategies. Finally, we establish theoretical lower bounds on the worst-case efficiency loss of equilibria in SPMI games, with such loss caused by the lack of coordination among noncooperative interdictors, and use the decentralized algorithms to numerically study the average-case efficiency loss.