The model of incomplete cooperative games incorporates uncertainty into the classical model of cooperative games by considering a partial characteristic function. Thus the values for some of the coalitions are not known. The main focus of this paper is 1-convexity under this framework. We are interested in two heavily intertwined questions. First, given an incomplete game, how can we fill in the missing values to obtain a complete 1-convex game? Second, how to determine in a rational, fair, (...) and efficient way the payoffs of players based only on the known values of coalitions? We illustrate the analysis with two classes of incomplete games—minimal incomplete games and incomplete games with defined upper vector. To answer the first question, for both classes, we provide a description of the set of 1-convex extensions in terms of its extreme points and extreme rays. Based on the description of the set of 1-convex extensions, we introduce generalisations of three solution concepts for complete games, namely the τ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}-value, the Shapley value and the nucleolus. For minimal incomplete games, we show that all of the generalised values coincide. We call it the average value and provide different axiomatisations. For incomplete games with defined upper vector, we show that the generalised values do not coincide in general. This highlights the importance and also the difficulty of considering more general classes of incomplete games. (shrink)

The principle of differential marginality (Casajus in Theory and Decis 71(2):163-–174) for cooperative games is a very appealing property that requires equal productivity differentials to translate into equal payoff differentials. In this paper we apply this property to axiomatic characterizations of values. We show that differential marginality implies additivity and symmetry under certain conditions. Based on this result, we propose new characterizations of the equal division and the equal surplus division values. Finally, we characterize two classes of convex (...) combinations of values, i.e., α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}-egalitarian Shapley values and α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}-equal surplus division values, by employing differential marginality and establishing the uniqueness of these values on inessential games. (shrink)

Gärdenfors (Conceptual spaces, 2000) argues that the semantic domains that natural language deals with have a geometrical structure. He gives evidence that simple natural language adjectives usually denote natural properties, where a natural property is a convex region of such a “conceptual space.” In this paper I will show that this feature of natural categories need not be stipulated as basic. In fact, it can be shown to be the result of evolutionary dynamics of communicative strategies under very general (...) assumptions. (shrink)

Externality games are studied in Grafe et al. (1998, Math. Methods Op. Res. 48, 71). We define a generalization of this class of games and show, using the methodology in Izquierdo and Rafels (1996, 2001, Working paper, Univ Barcelona; Games Econ. Behav. 36, 174), some properties of the new class of generalized externality games. They include, among others, the algebraic structure of the game, convexity, and their implications for the study of cooperative solutions. Also the proportional (...) rule is characterized for this class of games. (shrink)

We introduce a new class of population games called stable games. These games are characterized by self-defeating externalities: when agents revise their strategies, the improvements in the payoffs of strategies to which revising players are switching are always exceeded by the improvements in the payoffs of strategies which revising players are abandoning. We show that stable games subsume many well-known classes of examples, including zero-sum games, games with an interior ESS, wars of attrition, and (...) concave potential games. We prove that the set of Nash equilibria of any stable game is convex, and offer an elementary proof of existence of equilibrium. Finally, we show that the set of Nash equilibria of a stable game is globally asymptotically stable under a variety of evolutionary dynamics. These convergence results are proved by constructing Lyapunov functions defined in terms of revision potentials—that is, potential functions for the protocols agents follow when they consider switching strategies. (shrink)

There have been two main lines in the literature on restricted games: the first line was started by Myerson (1977) that studied graph-restricted games an the second one was initiated by Faigle (1989). The present paper provides a unified way to look on the literature and establishes connections between the two different lines on restricted games. The strength and advantages of this unified approach becomes clear in the study of the inheritance of the convexity from the game (...) to the restricted game where an interesting result by Nouweland and Borm (1991) on the convexity of graph-restricted games is turned into a direct consequence of the corresponding result by Faigle (1989), by means of this relation. (shrink)

We provide existence results in a game with local spillovers where the payoff function satisfies both convexity and the strategic substitutes property. We show that there always exists a stable pairwise network in this game, and provide a condition which ensures the existence of pairwise equilibrium networks.

During a cultural festival, artists and theaters act as a cartel by agreeing on pricing decisions that maximize the groups’ profit as a whole. We model the problem of sharing the profit created by a festival among organizing theaters as a cooperative game. In such a game, the worth of a coalition is defined as the theaters’ profit from the optimal fixation of prices. We show that this class of games is convex and we axiomatically characterize the Shapley (...) value for this class of games. We also provide an axiomatic basis for the downstream incremental solution. Finally, we apply this model to the NEXT festival, for which we have collected data. We propose an approach to derive the games’ vector from the data and we compute the different solutions. (shrink)

A situation, in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (point-valued) solution for TU-games assigns a payoff distribution to every TU-game. In this article we discuss a class of equal surplus sharing solutions consisting of all convex combinations of the CIS-value, the ENSC-value and the equal division solution. We provide several characterizations of this class of solutions on variable (...) and fixed player set. Specifications of several properties characterize specific solutions in this class. (shrink)

A situation, in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (point-valued) solution for TU-games assigns a payoff distribution to every TU-game. In this article we discuss a class of equal surplus sharing solutions consisting of all convex combinations of the CIS-value, the ENSC-value and the equal division solution. We provide several characterizations of this class of solutions on variable (...) and fixed player set. Specifications of several properties characterize specific solutions in this class. (shrink)

A solution for cooperative games with transferable utility, or simply TU-games, assigns a payoff vector to every TU-game. In this paper we discuss two classes of equal surplus sharing solutions. The first class consists of all convex combinations of the equal division solution and the center-of-gravity of the imputation-set value. The second class is the dual class consisting of all convex combinations of the equal division solution and the egalitarian non-separable contribution value. We provide characterizations of (...) the two classes of solutions using either population solidarity or a reduced game consistency in addition to other standard properties. (shrink)

Game-theoretic solution concepts such as Nash and Bayesian equilibrium start from an assumption that the players’ sets of possible payoffs, measured in units of von Neumann–Morgenstern utility, are common knowledge, and they go on to define rational behavior in terms of equilibrium strategy profiles that are either pure or independently randomized and which, in applications, are often taken to be uniquely determined or at least tightly constrained. A mechanism through which to obtain a common knowledge of payoff functions measured in (...) units of utility is not part of the model. This paper describes an operational method of constructing a state of common knowledge of the key parameters of the players’ utility functions in terms of conditional small bets on the game’s outcome. When the rationality criterion of joint coherence is applied in this setting, the solution of a game is typically characterized by a convex set of correlated equilibria. In the most general case, where players are risk averse, the parameters of the equilibria are risk-neutral probabilities, interpretable as products of subjective probabilities and relative marginal utilities for money, as in financial markets. Risk aversion generally enlarges the set of equilibria and may present opportunities for Pareto-improving modifications of the rules of the game. (shrink)

We propose a new notion of coalitional equilibria, the strong $$\beta$$ -hybrid solution, which is a refinement of the hybrid solution introduced by Zhao. Zhao’s solution is well suited to study situations where people cooperate within coalitions but where coalitions compete with one another. This paper’s solution, as opposed to the hybrid solution, assigns to each coalition a strategy profile that is strongly Pareto optimal. Moreover, like the $$\beta$$ -core, deviations by subcoalitions of any existing coalition are deterred by the (...) threat of a unique counter-strategy available to the non-deviating players. Zhao proved the existence of existence of strong $$\beta$$ -hybrid solution for transferable utility games with compact and convex strategy spaces and concave continuous payoff functions. Here, we extend his result to non-transferable utility games. (shrink)

Through a phenomenological study of horse-human relations, this article explores the ways in which, as embodied beings, we live relationally, rather than as separate human identities. Conceptually this challenges oppositional logic and humanist assumptions, but where poststructuralist treatments of these issues tend to remain abstract, this article is concerned with an embodied demonstration of the ways in which we experience a relational or in-between logic in our everyday lives.

This article discusses the set of Harsanyi payoff vectors of a cooperative TU-game, also known as the Selectope. We reconsider some results on Harsanyi payoff vectors within a more general framework. First, an intuitive approach is used, showing that the set of Harsanyi payoff vectors is the core of an associated convex game. Next, the set of individual rational Harsanyi payoff vectors, the Harsanyi imputations in short, is considered. Existence conditions are provided, and if non-empty, we provide a description (...) as the core of a well-defined convex game, and show that it is an externally stable set. (shrink)

We argue that pedagogic authority relies on love, which is misunderstood if seen as a matter of actions and subjects. Love is based not on finite subjects and objects existing in Euclidean space and linear time, but, rather, on the non-finite ontology, space and time of relations. Loving authority is a matter of calling and vocation, arising from the spontaneous and simultaneous call-and-response of a lively relation. We make this argument through a reading of Buber’s I–You relation and Murdoch’ s (...) account of the responsiveness of ascetic discipline. In presenting this analysis, we draw upon a case study from a research project on Australian teachers and students. (shrink)

Prior research suggests brokers do not always act in the best interests of clients, although morally obligated to do so. We empirically investigated this issue focusing on trades executed at best execution price, before and after the introduction of electronic limit-order trading, on the London Stock Exchange. As a result of limit-order trading, the proportion of trades executed at the best execution price for the customer significantly increased. We attribute this to a sustained increase in the liquidity of stocks as (...) a result of limit-order trading, regardless of market capitalisation. We discuss the ethical implications of our findings and conclude that market structures that enhance market competitiveness may help reconcile broker and client interests. (shrink)

This study examined the link between employees’ adult attachment orientations and perceptions of line managers’ interpersonal justice behaviors, and the moderating effect of national culture. Participants from countries categorized as low collectivistic and high collectivistic completed an online survey. Attachment anxiety and avoidance were negatively related to interpersonal justice perceptions. Cultural differences did not moderate the effects of avoidance. However, the relationship between attachment anxiety and interpersonal justice was non-significant in the Southern Asia cultural cluster. Our findings indicate the importance (...) of ‘fit’ between cultural relational values and individual attachment orientations in shaping interpersonal justice perceptions, and highlight the need for more non-western organizational justice research. (shrink)

We revisit the characterization of the Shapley value by van den Brink (Int J Game Theory, 2001, 30:309–319) via efficiency, the Null player axiom, and some fairness axiom. In particular, we show that this characterization also works within certain classes of TU games, including the classes of superadditive and of convex games. Further, we advocate some differential version of the marginality axiom (Young, Int J Game Theory, 1985, 14: 65–72), which turns out to be equivalent to the (...) van den Brink fairness axiom on large classes of games. (shrink)

Abstract In this article we develop a relational understanding of sociality, that is, an account of social life that takes relation as primary. This stands in contrast to the common assumption that relations arise when subjects interact, an account that gives logical priority to separation. We will develop this relational understanding through a reading of the work of Martin Buber, a social philosopher primarily interested in dialogue, meeting, relationship, and the irreducibility and incomparability of reality. In particular, the article contrasts (...) Buber’s work with that of poststructuralist theorists who take as their starting point the deconstruction of the Hegelian logic of binary oppositions. Deconstruction understands difference as the excess that undoes the binary, but Buber, we argue, shows how difference derives from the primacy and ontological undefinability of relation. Relational logic does not exclude the logic of separations and oppositions: relation is the primal ground that makes separations possible. Content Type Journal Article Pages 1-13 DOI 10.1007/s11841-011-0278-9 Authors Andrew Metcalfe, School of Social Sciences and International Studies, University of New South Wales, Sydney, NSW 2052, Australia Ann Game, School of Social Sciences and International Studies, University of New South Wales, Sydney, NSW 2052, Australia Journal Sophia Online ISSN 1873-930X Print ISSN 0038-1527. (shrink)

The mechanisms responsible for the fine tuning of development, where the wildtype phenotype is reproduced with high fidelity, are not well understood. The difficulty in approaching this problem is the identification of mutant phenotypes indicative of a defect in these fine‐tuning control mechanisms. Evolutionary biologists have used asymmetry as a measure of developmental homeostasis. The rationale for this was that, since the same genome controls the development of the left and right sides of a bilaterally symmetrical organism, departures from symmetry (...) can be used to measure genetic or environmental perturbations. This paper examines the relationship between asymmtry and resistance to organophosphorous insecticides in the Australian sheep blowfly, Lucilia cuprina. A resistance gene, Rop‐1, which encodes a carboxylesterase enzyme, also confers a significant increase in asymmetry. Continued exposure of resistant populations to insecticide has selected a dominant suppressor of the asymmetry phenotype. Genetic evidence indicates that the modifier is the L. cuprina Notch homologue. (shrink)

This article discusses the set of Harsanyi payoff vectors of a cooperative TU-game, also known as the Selectope. We reconsider some results on Harsanyi payoff vectors within a more general framework. First, an intuitive approach is used, showing that the set of Harsanyi payoff vectors is the core of an associated convex game. Next, the set of individual rational Harsanyi payoff vectors, the Harsanyi imputations in short, is considered. Existence conditions are provided, and if non-empty, we provide a description (...) as the core of a well-defined convex game, and show that it is an externally stable set. (shrink)

This paper investigates the existence of pure strategy Nash equilibria in discontinuous and nonquasiconcave games. We introduce a new notion of continuity, called weakly continuous security, which is weaker than the most known weak notions of continuity, including the surrogate point secure of SSYM game of Carbonell-Nicolau and Mclean (Econ Theory, 2018a), the continuous security of Barelli and Meneghel (Econometrica 81:813–824, 2013), C-security of McLennan et al. (Econometrica 79:1643–1664 2011), generalized weakly transfer continuity of Nessah (Economics 47:659–662, 2011), generalized (...) better-reply security of Carmona (Econ Theory 48:1–4, 2011), Barelli and Soza (On the existence of Nash equilibria in discontinuous and qualitative games, 2009), Barelli and Meneghel (Econometrica 81:813–824, 2013), lower single deviation property of Reny (Further results on the existence of Nash equilibria in discontinuous games. University of Chicago, 2009), better-reply security of Reny (Econometrica 67:1029–1056, 1999) and the results of Prokopovych (Econ Theory 48:5–16, 2011, Econ Theory 53:383–402, 2013) and Carmona (J Econ Theory 144:1333–1340, 2009). We show that a compact, convex and weakly continuous secure Hausdorff locally convex topological vector space game has a pure strategy Nash equilibrium. Moreover, it holds in a large class of discontinuous games. (shrink)

This paper reports the results of an experiment designed to uncover the stochastic structure of individual preferences over lotteries. Unlike previous experiments, which have presented subjects with pair-wise choices between lotteries, our design allowed subjects to choose between two lotteries or (virtually) any convex combination of the two lotteries. We interpret the mixtures of lotteries chosen by subjects as a measure of the stochastic structure of choice. We test between two alternative interpretations of stochastic choice: the random utility interpretation (...) and the deterministic preferences interpretation. The main findings of the experiment are that the typical subject prefers mixtures of lotteries rather than the extremes of a linear lottery choice set. The distribution of choices does not change between a first and second asking of the same question. We argue that this provides support for the deterministic preferences interpretation over the random utility interpretation of stochastic choice. As a subsidiary result, we find a small proportion of subjects make choices that violate transitivity, but the level of intransitive choice falls significantly over time. (shrink)

The interpretation of propositions in Lukasiewicz's infinite-valued calculus as answers in Ulam's game with lies--the Boolean case corresponding to the traditional Twenty Questions game--gives added interest to the completeness theorem. The literature contains several different proofs, but they invariably require technical prerequisites from such areas as model-theory, algebraic geometry, or the theory of ordered groups. The aim of this paper is to provide a self-contained proof, only requiring the rudiments of algebra and convexity in finite-dimensional vector spaces.

This article presents the results of an experiment that completely measures the utility function and probability weighting function for different positive and negative monetary outcomes, using a representative sample of N = 1,935 from the general public. The results confirm earlier findings in the lab, suggesting that utility is less pronounced than what is found in classical measurements where expected utility is assumed. Utility for losses is found to be convex, consistent with diminishing sensitivity, and the obtained loss-aversion coefficient (...) of 1.6 is moderate but in agreement with contemporary evidence. The estimated probability weighting functions have an inverse-S shape and they imply pessimism in both domains. These results show that probability weighting is also an important phenomenon in the general population. Women and lower educated individuals are found to be more risk averse, in agreement with common findings. In contrast to previous studies that ascribed gender differences in risk attitudes solely to differences in the degree utility curvature, however, our results show that this finding is primarily driven by loss aversion and, for women, also by a more pessimistic psychological response toward the probability of obtaining the best possible outcome. (shrink)

There is a plurality of formal constraints for aggregating probabilities of a group of individuals. Different constraints characterise different families of aggregation rules. In this paper, we focus on the families of linear and geometric opinion pooling rules which consist in linear, respectively, geometric weighted averaging of the individuals’ probabilities. For these families, it is debated which weights exactly are to be chosen. By applying the results of the theory of meta-induction, we want to provide a general rationale, namely, optimality, (...) for choosing the weights in a success-based way by scoring rules. A major argument put forward against weighting by scoring is that these weights heavily depend on the chosen scoring rule. However, as we will show, the main condition for the optimality of meta-inductive weights is so general that it holds under most standard scoring rules, more precisely under all scoring rules that are based on a convex loss function. Therefore, whereas the exact choice of a scoring rule for weighted probability aggregation might depend on the respective purpose of such an aggregation, the epistemic rationale behind such a choice is generally valid. (shrink)

For non-additive set functions, the independent product, in general, is not unique and the Fubini theorem is restricted to slice-comonotonic functions. In this paper, we use the representation theorem of Gilboa and Schmeidler (Math Oper Res 20:197–212, 1995) to extend the Möbius product for non-additive set functions to non-finite spaces. We extend the uniqueness result of Ghirardato (J Econ Theory 73:261–291, 1997) for products of two belief functions and weaken the requirements on the marginals necessary to obtain the Fubini property (...) in the product. More importantly, we show that for the Möbius product one side of the Fubini theorem holds for all integrable functions if one of the marginals either is a probability or a convex combination of a chain of unanimity games, i.e., we relax the requirement of slice-comonotonicity and enrich the set of possible applications. (shrink)

In this study, we analyze choice in the presence of some conflict that affects the decision time, a subject that has been documented in the literature. We axiomatize a multiattribute decision time representation, which is a dynamic extension of the classic multiattribute expected utility theory that allows potentially incomplete preferences. Under this framework, one alternative is preferred to another in a certain period if and only if the weighted sum of the attribute-dependent expected utility induced by the former alternative is (...) larger than that induced by the latter for all attribute weights in a closed and convex set. MDT uniquely determines the decision time as the earliest period at which the ranking between alternatives becomes decisive. The comparative statics result indicates that the decision time provides useful information to locate indifference curves in a specific setting. MDT also explains various empirical findings in economics and other relevant fields. (shrink)

In binary choice between discrete outcome lotteries, an individual may prefer lottery L1 to lottery L2 when the probability that L1 delivers a better outcome than L2 is higher than the probability that L2 delivers a better outcome than L1. Such a preference can be rationalized by three standard axioms (solvability, convexity and symmetry) and one less standard axiom (a fanning-in). A preference for the most probable winner can be represented by a skew-symmetric bilinear utility function. Such a utility function (...) has the structure of a regret theory when lottery outcomes are perceived as ordinal and the assumption of regret aversion is replaced with a preference for a win. The empirical evidence supporting the proposed system of axioms is discussed. (shrink)

Prospect theory emerged as one of the leading descriptive decision theories that can rationalize a large body of behavioral regularities. The methods for eliciting prospect theory parameters, such as its value function and probability weighting, are invaluable tools in decision analysis. This paper presents a new simple method for eliciting prospect theory’s value function without any auxiliary/simplifying parametric assumptions. The method is applicable both to choice under ambiguity (Knightian uncertainty) and risk (when events are characterized by objective probabilities). Our new (...) elicitation method is implemented in a simple paper-and-pencil experiment (via an iterative multiple price list format). This is one of the first experiments that elicits non-parametric prospect theory’s value function with salient rewards. The collected data generally confirm findings in the existing literature: the value function is S-shaped (concave in the gain domain and convex in the loss domain) though there is a weaker loss aversion on the aggregate level and a substantial heterogeneity in loss aversion on the individual level (41% loss averse, 6% loss neutral and 53% gain seeking). (shrink)

In the theoretical description of prospect theory, distinct sets of parameters can control the curvature of the value function and the shape of the probability weighting function. There is one for the gain domain and one for the loss domain. However, in most estimations, behaviour over losses is assumed to perfectly reflect behaviour over gains, through a unique set of parameters. We examine the consequences of relaxing this simplifying assumption in the context of Tanaka et al.’s (Am Econ Rev 100(1):557–571, (...) 2010) risk-elicitation procedure based on multiple price lists. We show that subjects’ behaviour for gains is mostly reflected for losses at the aggregate and individual levels, and is consistent with the distinctive prospect theory fourfold pattern. Reflection is only partial as the mean curvature of the value function is slightly less convex for losses than it is concave for gains. These results are robust to a high-stake context. However, we demonstrate that assuming reflection can have huge consequences on loss-aversion measures. Incidentally, we also highlight the existence of a strong, negative and persistent pure loss-frame effect on elicited loss aversion. We recommend that future practitioners and modellers are particularly cautious about the loss-aversion values they obtain or use because these are especially sensitive to parametric assumptions and framing. (shrink)

Schopenhauer is acknowledged as “the philosopher of pessimism” and author of a system that teaches how art and morality can help humans navigate life in “the worst of all possible worlds.” This dominant image has cut off an important branch of Schopenhauer’s tree of philosophy—metaphysics of nature and its constant dialogue with the sciences of the time. Beginning with a reappraisal of Schopenhauer’s system as a whole—which he defined as a “single thought”—this book interprets his metaphysics as a knowledge that (...) brings value and meaning to our lives. More specifically, Schopenhauer’s writings show that he saw science as adding value to metaphysical knowledge. Understanding Schopenhauer’s metaphysics therefore requires both an understanding of the dialogue he maintained with the natural sciences and an appreciation of the role of the natural sciences in his philosophical project. And exploring the relationship between science and metaphysics provides a new perspective on his metaphysics and its development between the first edition of The World as Will and Representation (1819) and 1844, when Schopenhauer added a second volume of Supplements to his work. In 1819, he valued Schelling’s philosophy of nature as a model for establishing a link between metaphysical speculation and science. In the years that followed, he assessed the implications for metaphysics of the transformation of scientific research into a practice increasingly independent of philosophy. Such an assessment also affected his metaphysics, and even the will and Ideas underwent a process of revision. (shrink)

Let T be a complete o-minimal extension of the theory of real closed fields. We characterize the convex hulls of elementary substructures of models of T and show that the residue field of such a convex hull has a natural expansion to a model of T. We give a quantifier elimination relative to T for the theory of pairs (R, V) where $\mathscr{R} \models T$ and V ≠ R is the convex hull of an elementary substructure of (...) R. We deduce that the theory of such pairs is complete and weakly o-minimal. We also give a quantifier elimination relative to T for the theory of pairs (R, N) with R a model of T and N a proper elementary substructure that is Dedekind complete in R. We deduce that the theory of such "tame" pairs is complete. (shrink)

This paper introduces a logical analysis of convex combinations within the framework of Łukasiewicz real-valued logic. This provides a natural link between the fields of many-valued logics and decision theory under uncertainty, where the notion of convexity plays a central role. We set out to explore such a link by defining convex operators on MV-algebras, which are the equivalent algebraic semantics of Łukasiewicz logic. This gives us a formal language to reason about the expected value of bounded random (...) variables. As an illustration of the applicability of our framework we present a logical version of the Anscombe–Aumann representation result. (shrink)

Convexity predicates and the convex hull operator continue to play an important role in theories of spatial representation and reasoning, yet their first-order axiomatization is still a matter of controversy. In this paper, we present a new approach to adding convexity to mereotopological theory with boundary elements by specifying first-order axioms for a binary segment operator s. We show that our axioms yields a convex hull operator h that supports, not only the basic properties of convex regions, (...) but also complex properties concerning region alignment. We also argue that h is stronger than convex hull operators from existing axiomatizations and show how to derive the latter from our axioms for s. (shrink)

Natural languages vary in their quantity expressions, but the variation seems to be constrained by general properties, so-calleduniversals. Their explanations have been sought among constraints of human cognition, communication, complexity, and pragmatics. In this article, we apply a state-of-the-art language coordination model to the semantic domain of quantities to examine whether two quantity universals—monotonicity and convexity—arise as a result of coordination. Assuming precise number perception by the agents, we evolve communicatively usable quantity terminologies in two separate conditions: a numeric-based condition (...) in which agents communicate about a number of objects and a quotient-based condition in which agents communicate about the proportions. We find out that both universals take off in all conditions but only convexity almost entirely dominates the emergent languages. Additionally, we examine whether the perceptual constraints of the agents can contribute to the further development of universals. We compare the degrees of convexity and monotonicity of languages evolving in populations of agents with precise and approximate number sense. The results suggest that approximate number sense significantly reinforces monotonicity and leads to further enhancement of convexity. Last but not least, we show that the properties of the evolved quantifiers match certain invariance properties from generalized quantifier theory. (shrink)