Efficiency in Multi-objective Games

In a multi-objective game, each agent individually evaluates each overall action-profile on multiple objectives. I generalize the price of anarchy to multi-objective games and provide a polynomial-time algorithm to assess it. This work asserts that policies on tobacco promote a higher economic efficiency

Extended Smoothed Boundary Method for Solving Partial Differential Equations with General Boundary Conditions on Complex Boundaries

In this article, we describe an approach for solving partial differential equations with general boundary conditions imposed on arbitrarily shaped boundaries. A continuous function, the domain parameter, is used to modify the original differential equations such that the equations are solved in the region where a domain parameter takes a specified value while boundary conditions are imposed on the region where the value of the domain parameter varies smoothly across a short distance. The mathematical derivations are straightforward and generically applicable to a wide variety of partial differential equations. To demonstrate the general applicability of the approach, we provide four examples herein: (1) the diffusion equation with both Neumann and Dirichlet boundary conditions; (2) the diffusion equation with both surface diffusion and reaction; (3) the mechanical equilibrium equation; and (4) the equation for phase transformation with the presence of additional boundaries. The solutions for several of these cases are validated against corresponding analytical and semi-analytical solutions. The potential of the approach is demonstrated with five applications: surface-reaction-diffusion kinetics with a complex geometry, Kirkendall-effect-induced deformation, thermal stress in a complex geometry, phase transformations affected by substrate surfaces, and a self-propelled droplet.Comment: This document is the revised version of arXiv:0912.1288v

A modification of Honoré's triple-link model in the synoptic problem

In New Testament studies, the synoptic problem is concerned with the relationships between the gospels of Matthew, Mark and Luke. In an earlier paper a careful specification in probabilistic terms was set up of Honoré's triple-link model. In the present paper, a modification of Honoré's model is proposed. As previously, counts of the numbers of verbal agreements between the gospels are examined to investigate which of the possible triple-link models appears to give the best fit to the data, but now using the modified version of the model and additional sets of data

Nash Social Welfare in Selfish and Online Load Balancing

In load balancing problems there is a set of clients, each wishing to select a resource from a set of permissible ones, in order to execute a certain task. Each resource has a latency function, which depends on its workload, and a client's cost is the completion time of her chosen resource. Two fundamental variants of load balancing problems are {\em selfish load balancing} (aka. {\em load balancing games}), where clients are non-cooperative selfish players aimed at minimizing their own cost solely, and {\em online load balancing}, where clients appear online and have to be irrevocably assigned to a resource without any knowledge about future requests. We revisit both selfish and online load balancing under the objective of minimizing the {\em Nash Social Welfare}, i.e., the geometric mean of the clients' costs. To the best of our knowledge, despite being a celebrated welfare estimator in many social contexts, the Nash Social Welfare has not been considered so far as a benchmarking quality measure in load balancing problems. We provide tight bounds on the price of anarchy of pure Nash equilibria and on the competitive ratio of the greedy algorithm under very general latency functions, including polynomial ones. For this particular class, we also prove that the greedy strategy is optimal as it matches the performance of any possible online algorithm