We evaluate the goal of maximizing the number of individually rational assignments. We show that it implies incentive, fairness, and implementation impossibilities. Despite that, we present two classes of mechanisms that maximize assignments. The first are Pareto efficient, and undominated - in...

We evaluate the goal of maximizing the number of individually rational assignments. We show that it implies incentive, fairness, and implementation impossibilities. Despite that, we present two classes of mechanisms that maximize assignments. The first are Pareto efficient, and undominated - in...

The recent emergence of GPGPU programming has resulted in a number of very efficient, but ultimately ad-hoc implementations of GPU accelerated simulations of complex systems. Because developing applications for the GPU is still a difficult and time consuming task, efficient GPU parallelizations...