Beyond Indifferent Players: On the Existence of Prisoners Dilemmas in games with amicable and adversarial preferences

Why don’t agents cooperate when they both stand to gain? This question ranks among the most fundamental in the social sciences. Explanations abound. Among the most compelling are various configurations of the prisoner’s dilemma (PD), or public goods problem. Payoffs in PD’s are specified in one of two ways: as primitive cardinal payoffs or as ordinal final utility. However, as final utility is objectively unobservable, only the primitive payoff games are ever observed. This paper explores mappings from primitive payoff to utility payoff games and demonstrates that though an observable game is a PD there are broad classes of utility functions for which there exists no associated utility PD. In particular we show that even small amounts of either altruism or enmity may disrupt the mapping from primitive payoff to utility PD. We then examine some implications of these results.

Black Holes with Multiple Charges and the Correspondence Principle

We consider the entropy of near extremal black holes with multiple charges in the context of the recently proposed correspondence principle of Horowitz and Polchinski, including black holes with two, three and four Ramond-Ramond charges. We find that at the matching point the black hole entropy can be accounted for by massless open strings ending on the D-branes for all cases except a black hole with four Ramond-Ramond charges, in which case a possible resolution in terms of brane-antibrane excitations is considered.Comment: 26 pages, harvmac, minor correction

A Correspondence Principle for Black Holes and Strings

For most black holes in string theory, the Schwarzschild radius in string units decreases as the string coupling is reduced. We formulate a correspondence principle, which states that (i) when the size of the horizon drops below the size of a string, the typical black hole state becomes a typical state of strings and D-branes with the same charges, and (ii) the mass does not change abruptly during the transition. This provides a statistical interpretation of black hole entropy. This approach does not yield the numerical coefficient, but gives the correct dependence on mass and charge in a wide range of cases, including neutral black holes.Comment: 24 pages, one typo correcte

Non-Preemptive Scheduling on Machines with Setup Times

Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n, m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.Comment: A conference version of this paper has been accepted for publication in the proceedings of the 14th Algorithms and Data Structures Symposium (WADS

Branes, AdS gravitons and Virasoro symmetry

We consider travelling waves propagating on the anti-de Sitter (AdS) background. It is pointed out that for any dimension d, this space of solutions has a Virasoro symmetry with a non-zero central charge. This result is a natural generalization to higher dimensions of the three-dimensional Brown-Henneaux symmetry.Comment: 4 pages REVTe

Black Hole Hair Removal: Non-linear Analysis

BMPV black holes in flat transverse space and in Taub-NUT space have identical near horizon geometries but different microscopic degeneracies. It has been proposed that this difference can be accounted for by different contribution to the degeneracies of these black holes from hair modes, -- degrees of freedom living outside the horizon. In this paper we explicitly construct the hair modes of these two black holes as finite bosonic and fermionic deformations of the black hole solution satisfying the full non-linear equations of motion of supergravity and preserving the supersymmetry of the original solutions. Special care is taken to ensure that these solutions do not have any curvature singularity at the future horizon when viewed as the full ten dimensional geometry. We show that after removing the contribution due to the hair degrees of freedom from the microscopic partition function, the partition functions of the two black holes agree.Comment: 40 pages, LaTe

An EPTAS for Scheduling on Unrelated Machines of Few Different Types

In the classical problem of scheduling on unrelated parallel machines, a set of jobs has to be assigned to a set of machines. The jobs have a processing time depending on the machine and the goal is to minimize the makespan, that is the maximum machine load. It is well known that this problem is NP-hard and does not allow polynomial time approximation algorithms with approximation guarantees smaller than $1.5$ unless P$=$NP. We consider the case that there are only a constant number $K$ of machine types. Two machines have the same type if all jobs have the same processing time for them. This variant of the problem is strongly NP-hard already for $K=1$. We present an efficient polynomial time approximation scheme (EPTAS) for the problem, that is, for any $\varepsilon > 0$ an assignment with makespan of length at most $(1+\varepsilon)$ times the optimum can be found in polynomial time in the input length and the exponent is independent of $1/\varepsilon$. In particular we achieve a running time of $2^{\mathcal{O}(K\log(K) \frac{1}{\varepsilon}\log^4 \frac{1}{\varepsilon})}+\mathrm{poly}(|I|)$, where $|I|$ denotes the input length. Furthermore, we study three other problem variants and present an EPTAS for each of them: The Santa Claus problem, where the minimum machine load has to be maximized; the case of scheduling on unrelated parallel machines with a constant number of uniform types, where machines of the same type behave like uniformly related machines; and the multidimensional vector scheduling variant of the problem where both the dimension and the number of machine types are constant. For the Santa Claus problem we achieve the same running time. The results are achieved, using mixed integer linear programming and rounding techniques

Effective spatial dimension of extremal non-dilatonic black p-branes and the description of entropy on the world volume

By investigating the critical behavior appearing at the extremal limit of the non-dilatonic, black p-branes in (d+p) dimensions, we find that some critical exponents related to the critical point obey the scaling laws. From the scaling laws we obtain that the effective spatial dimension of the non-dilatonic black holes and black strings is one, and is p for the non-dilatonic black p-branes. For the dilatonic black holes and black p-branes, the effective dimension will depend on the parameters in theories. Thus, we give an interpretation why the Bekenstein-Hawking entropy may be given a simple world volume interpretation only for the non-dilatonic black p-branes.Comment: 4 pages, RevTex, no figures, to appear in Phys. Rev. Let

Black Branes in a Box: Hydrodynamics, Stability, and Criticality

We study the effective hydrodynamics of neutral black branes enclosed in a finite cylindrical cavity with Dirichlet boundary conditions. We focus on how the Gregory-Laflamme instability changes as we vary the cavity radius R. Fixing the metric at the cavity wall increases the rigidity of the black brane by hindering gradients of the redshift on the wall. In the effective fluid, this is reflected in the growth of the squared speed of sound. As a consequence, when the cavity is smaller than a critical radius the black brane becomes dynamically stable. The correlation with the change in thermodynamic stability is transparent in our approach. We compute the bulk and shear viscosities of the black brane and find that they do not run with R. We find mean-field theory critical exponents near the critical point.Comment: 23 pages, 3 figures. v2: added comments on first-order phase transitio