Ranking Agents of Justice: When Should the Corporation Act?

Theorists have argued that under certain background conditions the commercial, for-profit corporation might bear responsibility to act to advance justice. However, other agents too may be responsible to take remedial action, especially when the state defaults. This raises the question of the sequence in which the agents should act. I develop a framework that offers guidance in determining when the corporation ought to intervene to advance justice. The existing literature typically identifies responsibility-bearers solely by their capacity to remedy an unjust situation which I believe to be too simplistic. I introduce two additional grounds for identifying responsibility-bearers, a role-based account and participation-based account and show that this pluralist approach delivers a better account of who bears responsibility to act and when to discharge this responsibility

Evidential Probabilities and Credences

Enjoying great popularity in decision theory, epistemology, and philosophy of science, Bayesianism as understood here is fundamentally concerned with epistemically ideal rationality. It assumes a tight connection between evidential probability and ideally rational credence, and usually interprets evidential probability in terms of such credence. Timothy Williamson challenges Bayesianism by arguing that evidential probabilities cannot be adequately interpreted as the credences of an ideal agent. From this and his assumption that evidential probabilities cannot be interpreted as the actual credences of human agents either, he concludes that no interpretation of evidential probabilities in terms of credence is adequate. I argue to the contrary. My overarching aim is to show on behalf of Bayesians how one can still interpret evidential probabilities in terms of ideally rational credence and how one can maintain a tight connection between evidential probabilities and ideally rational credence even if the former cannot be interpreted in terms of the latter. By achieving this aim I illuminate the limits and prospects of Bayesianism

A GPU-enabled solver for time-constrained linear sum assignment problems

This paper deals with solving large instances of the Linear Sum Assignment Problems (LSAPs) under realtime constraints, using Graphical Processing Units (GPUs). The motivating scenario is an industrial application for P2P live streaming that is moderated by a central tracker that is periodically solving LSAP instances to optimize the connectivity of thousands of peers. However, our findings are generic enough to be applied in other contexts. Our main contribution is a parallel version of a heuristic algorithm called Deep Greedy Switching (DGS) on GPUs using the CUDA programming language. DGS sacrifices absolute optimality in favor of a substantial speedup in comparison to classical LSAP solvers like the Hungarian and auctioning methods. We show the modifications needed to parallelize the DGS algorithm and the performance gains of our approach compared to a sequential CPU-based implementation of DGS and a mixed CPU/GPU-based implementation of it