Journal Article10.1016/J.FUTURE.2020.02.035
A meritocratic trust-based group formation in an IoT environment for smart cities
35
TL;DR: A group formation algorithm capable to asymptotically maximize the social capital is proposed, which highlights two main features: (i) the computed solution is a Nash equilibrium in the considered game and (ii) the only rewarded agents are those having the most correct behaviors.
read more
About: This article is published in Future Generation Computer Systems. The article was published on 01 Jul 2020. The article focuses on the topics: Software agent & Smart city.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Trust-based Friend Selection Algorithm for navigability in social Internet of Things
TL;DR: A generic reference model was designed and optimization decision theory was utilized for optimal friend choice to reduce resource consumption and the results illuminated that a rational selection of friends per service exploration fortifies global navigability in measuring average path length, degree distribution, and the number of links.
27
An IoT-based resource utilization framework using data fusion for smart environments
TL;DR: In this paper , the authors proposed a triple phase resource utilised data fusion (TPRUDF) framework for resource utilization in IoT-based systems, which employs three phases of data fusion: data in-data out, data in -feature out, and feature in -decision out.
18
Proximity-based group formation game model for community detection in social network
TL;DR: Zhang et al. as discussed by the authors proposed a proximity-based group formation game model, called PBCD, to detect communities in social networks based on an empirical observation that the higher number of shared communities gives rise to the higher second-order pairwise proximity.
16
A Trust-Aware and Authentication-Based Collaborative Method for Resource Management of Cloud-Edge Computing in Social Internet of Things
TL;DR: In this paper , a general reference model is designed and presented to select a friend to access group message remote processing services and minimize cloud-edge resources, and the simulation results show that for the correct communication of friends at the edge of the network and in each service discovery, according to the length of the path in the network, it is possible to establish stable communication and make better service with the least possible.
12
References
•Book
Dynamic Noncooperative Game Theory
Tamer Basar,Geert Jan Olsder +1 more
- 01 Jan 1982
TL;DR: In this paper, the authors present a general formulation of non-cooperative finite games: N-Person nonzero-sum games, Pursuit-Evasion games, and Stackelberg Equilibria of infinite dynamic games.
5.2K
On the logic of theory change: Partial meet contraction and revision functions
TL;DR: In this article, the authors extend earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising it to introduce a new proposition.
3.4K
•Book
Understanding belief propagation and its generalizations
Jonathan S. Yedidia,William T. Freeman,Yair Weiss +2 more
- 01 Jan 2003
TL;DR: It is shown that BP can only converge to a fixed point that is also a stationary point of the Bethe approximation to the free energy, which enables connections to be made with variational approaches to approximate inference.
1.8K
Negotiation as a Metaphor for Distributed Problem Solving
Randall Davis,Reid G. Smith +1 more
TL;DR: A framework called the contract net is presented that specifies communication and control in a distributed problem solver, and comparisons with planner, conniver, hearsay-ii, and pup 6 are used to demonstrate that negotiation is a natural extension to the transfer of control mechanisms used in earlier problem-solving systems.
1.3K
•Dissertation
A family of algorithms for approximate bayesian inference
Tom Minka,Rosalind W. Picard +1 more
- 01 Jan 2001
TL;DR: This thesis presents an approximation technique that can perform Bayesian inference faster and more accurately than previously possible, and is found to be convincingly better than rival approximation techniques: Monte Carlo, Laplace's method, and variational Bayes.
1.1K