Skip to content

Latest commit

 

History

History
61 lines (40 loc) · 2.36 KB

Welcome.md

File metadata and controls

61 lines (40 loc) · 2.36 KB

title Pol.is Graph Theoretic Modeling description Formalizing the Pol.is graph

Pol.is Graph Theoretic Modeling

hackmd-github-sync-badge

:::info

  • If you're reading this, you're welcome to contribute! 🎉
  • For existing pages:
    • Make use of comments and ample +1s.
    • Edit text directly if you find inaccuracies.
    • In case of doubt, reach out to the page author.
  • To start working in a new direction:
    • Start a new page.
    • Link to it below (see existing links).
    • Tend after the pages you authored:
      • Follow up on page edits and comments.
      • Engage in discussion with those who reach out. :::

Main author: Giorgos Georgiadis

Pol.is is a deliberation platform where participants are called to vote (agree/disagree/pass) on a number of statements. At the same time, they are free to add their own statements for subsequent users to vote on[1].

This document aims to study the resulting poll from a graph theoretical point of view, and derive, if possible, useful analytical properties. Possible uses for this analysis are

  • strengthening the polling process (e.g. resistance to coordinated voting attacks),
  • suggesting directions of improvement,
  • better understanding of the computational complexity of common actions,
  • ...

Introduction

Modeling

Related Literature

Experiments

Code for the experiments can be found on https://github.com/ThenWho/pol-is-link-prediction Open In Colab

TODO / interesting directions

[1] https://roamresearch.com/#/app/polis-methods/page/1GR4r4LX8