anonymous agents
Recently Published Documents


TOTAL DOCUMENTS

13
(FIVE YEARS 1)

H-INDEX

5
(FIVE YEARS 0)

Information ◽  
2021 ◽  
Vol 12 (6) ◽  
pp. 254
Author(s):  
Matthew Connor ◽  
Othon Michail ◽  
Paul Spirakis

We study the class of networks, which can be created in polylogarithmic parallel time by network constructors: groups of anonymous agents that interact randomly under a uniform random scheduler with the ability to form connections between each other. Starting from an empty network, the goal is to construct a stable network that belongs to a given family. We prove that the class of trees where each node has any k≥2 children can be constructed in O(logn) parallel time with high probability. We show that constructing networks that are k-regular is Ω(n) time, but a minimal relaxation to (l,k)-regular networks, where l=k−1, can be constructed in polylogarithmic parallel time for any fixed k, where k>2. We further demonstrate that when the finite-state assumption is relaxed and k is allowed to grow with n, then k=loglogn acts as a threshold above which network construction is, again, polynomial time. We use this to provide a partial characterisation of the class of polylogarithmic time network constructors.


2018 ◽  
Vol 24 (5) ◽  
pp. 1222-1239
Author(s):  
Nicola Amendola ◽  
Leo Ferraris

We propose a model in which money performs an essential role in the process of exchange, despite the presence of a multilateral clearing house that collects resources from and distributes them to anonymous agents. Money improves the functioning of the clearing house, simultaneously keeping the incentives to contribute and guaranteeing the fine-tuning of allocations.


2018 ◽  
Vol 84 (857) ◽  
pp. 17-00338-17-00338
Author(s):  
Shunya YAMASHITA ◽  
Daisuke KURABAYASHI ◽  
Yuya HATTORI
Keyword(s):  

Episteme ◽  
2013 ◽  
Vol 11 (1) ◽  
pp. 63-81 ◽  
Author(s):  
Karen Frost-Arnold

AbstractSince anonymous agents can spread misinformation with impunity, many people advocate for greater accountability for internet speech. This paper provides a veritistic argument that accountability mechanisms can cause significant epistemic problems for internet encyclopedias and social media communities. I show that accountability mechanisms can undermine both the dissemination of true beliefs and the detection of error. Drawing on social psychology and behavioral economics, I suggest alternative mechanisms for increasing the trustworthiness of internet communication.


Sign in / Sign up

Export Citation Format

Share Document