94,155 research outputs found

    The Price of Anarchy for Network Formation in an Adversary Model

    Full text link
    We study network formation with n players and link cost \alpha > 0. After the network is built, an adversary randomly deletes one link according to a certain probability distribution. Cost for player v incorporates the expected number of players to which v will become disconnected. We show existence of equilibria and a price of stability of 1+o(1) under moderate assumptions on the adversary and n \geq 9. As the main result, we prove bounds on the price of anarchy for two special adversaries: one removes a link chosen uniformly at random, while the other removes a link that causes a maximum number of player pairs to be separated. For unilateral link formation we show a bound of O(1) on the price of anarchy for both adversaries, the constant being bounded by 10+o(1) and 8+o(1), respectively. For bilateral link formation we show O(1+\sqrt{n/\alpha}) for one adversary (if \alpha > 1/2), and \Theta(n) for the other (if \alpha > 2 considered constant and n \geq 9). The latter is the worst that can happen for any adversary in this model (if \alpha = \Omega(1)). This points out substantial differences between unilateral and bilateral link formation

    Playing Beowulf: Bridging computational thinking, arts and literature through game-making

    Get PDF
    Preparing younger generations to engage meaningfully with digital technology is often seen as one of the goals of 21st century education. JeanetteWing’s seminal work on Computational Thinking (CT) is an important landmark for this goal: CT represents a way of thinking, a set of problem-solving skills which can be valuable when interacting with digital technologies, and with different fields of knowledge, such as Arts and Humanities. Even if this cross-areas relevance has been celebrated and acknowledged in theoretical research, there has been a lack of practical projects exploring these links between CT and non-STEM fields. This research develops these links. We present a specific case – a game produced by two 14 years-old boys – within Playing Beowulf, a collaboration with the British library’s Young Researchers programme, in which students aged 13–14 from an inner-London (UK) school have developed games based on their own readings of the Anglo-Saxon poem Beowulf during an after-school club. The game was produced using MissionMaker, a software (currently under development at UCL Knowledge Lab) that allows users to create and code their own first-person 3D games in a simple way, using pre-made 3D assets, such as rooms, props, characters and weapons and a simplified programming language manipulated through drop-down lists. We argue that MissionMaker, by simplifying the development process (low floor), can be a means to foster the building of knowledge in both STEM (CT) and Arts and Humanities, building bridges between these two areas inside and outside traditional schooling

    New Results for Domineering from Combinatorial Game Theory Endgame Databases

    Full text link
    We have constructed endgame databases for all single-component positions up to 15 squares for Domineering, filled with exact Combinatorial Game Theory (CGT) values in canonical form. The most important findings are as follows. First, as an extension of Conway's [8] famous Bridge Splitting Theorem for Domineering, we state and prove another theorem, dubbed the Bridge Destroying Theorem for Domineering. Together these two theorems prove very powerful in determining the CGT values of large positions as the sum of the values of smaller fragments, but also to compose larger positions with specified values from smaller fragments. Using the theorems, we then prove that for any dyadic rational number there exist Domineering positions with that value. Second, we investigate Domineering positions with infinitesimal CGT values, in particular ups and downs, tinies and minies, and nimbers. In the databases we find many positions with single or double up and down values, but no ups and downs with higher multitudes. However, we prove that such single-component ups and downs easily can be constructed. Further, we find Domineering positions with 11 different tinies and minies values. For each we give an example. Next, for nimbers we find many Domineering positions with values up to *3. This is surprising, since Drummond-Cole [10] suspected that no *2 and *3 positions in standard Domineering would exist. We show and characterize many *2 and *3 positions. Finally, we give some Domineering positions with values interesting for other reasons. Third, we have investigated the temperature of all positions in our databases. There appears to be exactly one position with temperature 2 (as already found before) and no positions with temperature larger than 2. This supports Berlekamp's conjecture that 2 is the highest possible temperature in Domineering

    Wittgenstein on the foundations of language : A non foundational narration

    Get PDF
    The primary objective of this paper is to show that for later Wittgenstein, language cannot be based on a pre-linguistic foundation. Following closely on the tracks of the philosopher, it argues that none of the proposed foundations that are claimed to relate language to reality - viz. verbal definitions, ostensive techniques, mental images, quantitative measurement , Fregean thought or intention - is able to sustain its assumed pre-interpretive character. In a dense exegetical engagement with Wittgenstein, the paper lays out that the hallowed pre-interpretive reference taken to underlie the varying modes of interpretations or descriptions is actually a grammatical interplay, where what seems to be the pre-interpretive simple in one game turns out to be an elaborately complex construction in another. In the ultimate analysis, language and behaviour forge a non-foundational blend that internalizes and does not represent a supposedly extra-linguistic reality

    Generative Design in Minecraft (GDMC), Settlement Generation Competition

    Full text link
    This paper introduces the settlement generation competition for Minecraft, the first part of the Generative Design in Minecraft challenge. The settlement generation competition is about creating Artificial Intelligence (AI) agents that can produce functional, aesthetically appealing and believable settlements adapted to a given Minecraft map - ideally at a level that can compete with human created designs. The aim of the competition is to advance procedural content generation for games, especially in overcoming the challenges of adaptive and holistic PCG. The paper introduces the technical details of the challenge, but mostly focuses on what challenges this competition provides and why they are scientifically relevant.Comment: 10 pages, 5 figures, Part of the Foundations of Digital Games 2018 proceedings, as part of the workshop on Procedural Content Generatio

    The Search for the "Essence of Human Language" in Wittgenstein and Davidson

    Get PDF
    This paper offers an interpretation of the later Wittgenstein's handling of the idea of an "essence of human language", and examines in particular his treatment of the 'Augustinean' vision of reference as constituting this "essence". A central theme of the interpretation is the perennial philosophical desire to impose upon linguistic meaning conceptual templates drawn from outside the forms of thought about meaning in which we engage when we exercise our capacity to speak and understand a language. The paper closes with a consideration of ways in which Donald Davidson's generally congenial work on interpretation may diverge from Wittgenstein's thinking in this vicinity
    • …
    corecore