Near-optimal asymmetric binary matrix partitions

We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al. (WINE 2013) to model the impact of asymmetric information on the revenue of the seller in take-it-or-leave-it sales. Instances of the problem consist of an $n \times m$ binary matrix $A$ and a probability distribution over its columns. A partition scheme $B=(B_1,...,B_n)$ consists of a partition $B_i$ for each row $i$ of $A$. The partition $B_i$ acts as a smoothing operator on row $i$ that distributes the expected value of each partition subset proportionally to all its entries. Given a scheme $B$ that induces a smooth matrix $A^B$, the partition value is the expected maximum column entry of $A^B$. The objective is to find a partition scheme such that the resulting partition value is maximized. We present a $9/10$-approximation algorithm for the case where the probability distribution is uniform and a $(1-1/e)$-approximation algorithm for non-uniform distributions, significantly improving results of Alon et al. Although our first algorithm is combinatorial (and very simple), the analysis is based on linear programming and duality arguments. In our second result we exploit a nice relation of the problem to submodular welfare maximization.Comment: 17 page

Near-Optimal Asymmetric Binary Matrix Partitions

We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al. (Proceedings of the 9th Conference on Web and Internet Economics (WINE), pp 1–14, 2013). Instances of the problem consist of an n× m binary matrix A and a probability distribution over its columns. A partition schemeB= (B1, … , Bn) consists of a partition Bifor each row i of A. The partition Biacts as a smoothing operator on row i that distributes the expected value of each partition subset proportionally to all its entries. Given a scheme B that induces a smooth matrix AB, the partition value is the expected maximum column entry of AB. The objective is to find a partition scheme such that the resulting partition value is maximized. We present a 9/10-approximation algorithm for the case where the probability distribution is uniform and a (1 - 1 / e) -approximation algorithm for non-uniform distributions, significantly improving results of Alon et al. Although our first algorithm is combinatorial (and very simple), the analysis is based on linear programming and duality arguments. In our second result we exploit a nice relation of the problem to submodular welfare maximization

An alternative approach to the galactic dark matter problem

We discuss scenarios in which the galactic dark matter in spiral galaxies is described by a long range coherent field which settles in a stationary configuration that might account for the features of the galactic rotation curves. The simplest possibility is to consider scalar fields, so we discuss in particular, two mechanisms that would account for the settlement of the scalar field in a non-trivial configuration in the absence of a direct coupling of the field with ordinary matter: topological defects, and spontaneous scalarization.Comment: 36 pages, 12 figures, Revtex, a brief discussion added, accepted for publication in PR

Increasing Dominance - the Role of Advertising, Pricing and Product Design

Despite the empirical relevance of advertising strategies in concentrated markets, the economics literature is largely silent on the effect of persuasive advertising strategies on pricing, market structure and increasing (or decreasing) dominance. In a simple model of persuasive advertising and pricing with differentiated goods, we analyze the interdependencies between ex-ante asymmetries in consumer appeal, advertising and prices. Products with larger initial appeal to consumers will be advertised more heavily but priced at a higher level - that is, advertising and price discounts are strategic substitutes for products with asymmetric initial appeal. We find that the escalating effect of advertising dominates the moderating effect of pricing so that post-competition market shares are more asymmetric than pre-competition differences in consumer appeal. We further find that collusive advertising (but competitive pricing) generates the same market outcomes, and that network effects lead to even more extreme market outcomes, both directly and via the effect on advertising

Game theory of mind

This paper introduces a model of ‘theory of mind’, namely, how we represent the intentions and goals of others to optimise our mutual interactions. We draw on ideas from optimum control and game theory to provide a ‘game theory of mind’. First, we consider the representations of goals in terms of value functions that are prescribed by utility or rewards. Critically, the joint value functions and ensuing behaviour are optimised recursively, under the assumption that I represent your value function, your representation of mine, your representation of my representation of yours, and so on ad infinitum. However, if we assume that the degree of recursion is bounded, then players need to estimate the opponent's degree of recursion (i.e., sophistication) to respond optimally. This induces a problem of inferring the opponent's sophistication, given behavioural exchanges. We show it is possible to deduce whether players make inferences about each other and quantify their sophistication on the basis of choices in sequential games. This rests on comparing generative models of choices with, and without, inference. Model comparison is demonstrated using simulated and real data from a ‘stag-hunt’. Finally, we note that exactly the same sophisticated behaviour can be achieved by optimising the utility function itself (through prosocial utility), producing unsophisticated but apparently altruistic agents. This may be relevant ethologically in hierarchal game theory and coevolution

Dental Fear: One Single Clinical Question for Measurement

A new dental fear measurement instrument, the Short Dental Fear Question (SDFQ), was developed and tested for clinical practice purposes. The correlations of the SDFQ with the Dental Anxiety Scale (DAS) and the Dental Fear Survey (DFS) were tested in 15-16-year-old adolescents. The Spearman correlations (rs) between the dental fear measurement instruments were: SDFQ – DFS: rs = 0.79, n = 26; DFS – DAS: rs = 0.72, n = 26; SDFQ– DAS: rs = 0.69, n = 27. DAS and DFS mean scores were clearly higher in the SDFQ fear group than SDFQ in the relaxed group. The SDFQ is a short and compact instrument which might be convenient for the measurement of dental fear in clinical practice