Geometric Spanner Games

Theoretical Computer Science（2019）CCF BSCI 4区

Sharif Univ Technol | Inst Res Fundamental Sci IPM

Cited 5|Views17

Abstract

Consider a scenario in which several agents are located in the Euclidean space, and the agents want to create a network in which everyone has fast access to all or some other agents. Geometric t-spanners are examples of such a network providing fast connections between the nodes of the network for some fixed value t, i.e. the length of the shortest path between any two nodes in the network is at most t times their Euclidean distance. Geometric t-spanners have been extensively studied in the area of computational geometry where they are created by a central authority. In this paper, we investigate a situation in which selfish agents want to create such a network in the absence of a central authority. To this end, we introduce two different non-cooperative games: the t-spanner game and the sink t-spanner game, where it is vital for the agents to have a fast connection to all other agents or to a special node, respectively. We study the existence of the Nash equilibrium in both games and present some structural properties of the resulting networks in the Nash equilibrium.

Translated text

Key words

t-Spanner,Network creation games,Price of anarchy

Bibtex

AI Read Science

AI Summary

AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.

Example

Background

Key content

Introduction

Methods

Results

Related work

Fund

Key content

Pretraining has recently greatly promoted the development of natural language processing (NLP)
We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance

Try using models to generate summary,it takes about 60s

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper