A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Node Aggregation for Enhancing PageRank
2017
IEEE Access
Preserved Fulltext
PageRank is one of the parameters used by the search engine Google to determine the relevance of a web page. ...
Several examples are presented to illustrate the different approaches that we propose. ...
GLOBAL APPROACH: COOPERATIVE GAMES BASED ON THE PAGERANK Game theory deals with situations in which there are several coupled interacting entities. ...
doi:10.1109/access.2017.2750700
fatcat:a42nlnx4zvbtvmgymyo2fiyfsi
Network Essence: PageRank Completion and Centrality-Conforming Markov Chains
[chapter]
2017
A Journey Through Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
But I hope featuring them together in a broader context will help to illustrate the desirable properties of this Markovian completion of networks, and motivate systematic developments of a network theory ...
In the age of social and information networks, I will then turn the discussion from geometric structures to network structures, attempting to take a humble step towards the holy grail of network science ...
We refer to weighted hypergraphs as cooperative networks because they are the central subjects in classical cooperative game theory, but under a different name [82] . ...
doi:10.1007/978-3-319-44479-6_31
fatcat:6pt6d3uxr5a63i67yb737q3ylm
Network Essence: PageRank Completion and Centrality-Conforming Markov Chains
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
But I hope featuring them together in a broader context will help to illustrate the desirable properties of this Markovian completion of networks, and motivate systematic developments of a network theory ...
In the age of social and information networks, I will then turn the discussion from geometric structures to network structures, attempting to take a humble step towards the holy grail of network science ...
We refer to weighted hypergraphs as cooperative networks because they are the central subjects in classical cooperative game theory, but under a different name [82] . ...
arXiv:1708.07906v1
fatcat:hdzxzf2icjd3bjrc2nn2zo4the
Ranking and Cooperation in Real-World Complex Networks
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
To categorize people as experts and to evaluate their willingness to cooperate, one can use ranking and cooperation problems from complex networks. ...
In this paper, we investigate classical ranking algorithms besides the prisoner dilemma game to simulate cooperation and defection of agents. ...
These issues have been modeled with game theory approaches such as Prisoner's Dilemma (PD) [24] [25] . Merrill M. ...
arXiv:1901.06611v1
fatcat:clg63et35rhrhc4cja273wfeuq
"Intelligent Heuristics Are the Future of Computing"
2023
ACM Transactions on Intelligent Systems and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
In one of his lectures that year on AI search for games and puzzles, Professor Hans Berliner—a pioneer of computer chess programs 1 —stated: As a student in the field of the theory of computation, I was ...
I had been trained to believe that "Algorithms and computational complexity theory are the foundation of computer science." ...
ACKNOWLEDGMENTS I first express my gratitude to ACM KDD 2022 General Chairs Aidong Zhang, and Huzefa Rangwala for inviting me to present my work as a keynote talk, which inspired this article. ...
doi:10.1145/3627708
fatcat:addv2hndk5b47gje2a436b4meu
The Ranking Prediction of NBA Playoffs Based on Improved PageRank Algorithm
2021
Complexity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
It is of great significance to predict the results accurately based on the statistics of sports competition for participants research, commercial cooperation, advertising, and gambling profit. ...
In the PR value calculation formula of the PageRank algorithm, the factor W(u, v) between pages is added to replace the original Nu (the number of links to page u). ...
, the prediction of the outcome of the game is a very professional field problem. e NBA's data system is amazing to the degree of quantification of the game. e NBA has always relied on cutting-edge technology ...
doi:10.1155/2021/6641242
fatcat:idqbrne6gbberpbywusehbzrqy
A Shapley Value Approach for Influence Attribution
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we study the problem of attributing influence scores to individuals who accomplish tasks in a collaborative manner. ...
The proposed method is applicable to a variety of scenarios, for example, attributing influence scores to scientists who collaborate in published articles, or employees of a company who participate in ...
Additionally, this work was partially supported by the Spanish Centre for the Development of Industrial Technology under the CENIT program, project CEN20101037, "Social Media" 2 . ...
doi:10.1007/978-3-642-23783-6_35
fatcat:kxfcyffa5fgcnfp3itmmaoybby
Game-Theoretic Aspects of Designing Hyperlink Structures
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We use a similar linear program to address our problem (and, by extension all infinite horizon discounted MDPs) from the perspective of cooperative game theory: if each web page is controlled by an autonomous ...
We study the problem of designing the hyperlink structure between the web pages of a web site in order to maximize the revenue generated from the traffic on the web site. ...
We would like to thank Gary Flake for asking the question that motivated this work. We have benefitted from discussions with Christian Borgs, Jennifer Chayes, Uri Feige, and Gary Flake. ...
doi:10.1007/11944874_15
fatcat:5ytl7rsh7rdh3ou7ajh4wfzuwi
Scalable Algorithms for Data and Network Analysis
2016
Foundations and Trends® in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements The writing of this article is supported in part by a Simons Investigator Award from the Simons Foundation and the NSF grant CCF-1111270.
Shang-Hua Teng Los Angeles ...
; axiomatization; game theory; cooperative games; Shapley value; behaviors of algorithms; beyond worst-case analysis. ...
for the next chapter, this short chapter will focus on an annealing approach to construct robust PageRank estimators. ...
doi:10.1561/0400000051
fatcat:jkfytl34ifh4ldfdsiugrrgv7m
Strategic foundation of computational social science
2014
Proceedings of the 23rd International Conference on World Wide Web - WWW '14 Companion
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In order to suggest theoretical foundations, validation of the predictions in a controlled environment, and verification of the results in actual platforms, general approaches and a few examples of ongoing ...
This project aims to develop a rational-choice-theory-driven framework for computational social science, focusing on social interactions on the Internet. ...
Since the interactions between reciprocity concerning individuals can be modeled by a non-cooperative game, strategic models of relationship maintenance can serve as a foundational approach for understanding ...
doi:10.1145/2567948.2567962
dblp:conf/www/Sohn14
fatcat:vpjzkgfbafdfrgzmidevnw2kzm
Salience Rank: Efficient Keyphrase Extraction with Topic Modeling
2017
Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The ranking procedure consists of running PageRank K times, where K is the number of topics used in the LDA model. In this paper, we propose a modification of TPR, called Salience Rank. ...
Salience Rank only needs to run PageRank once and extracts comparable or better keyphrases on benchmark datasets. ...
Acknowledgments We would like to thank Matthias Seeger, Cedric Archambeau, Jan Gasthaus, Alex Klementiev, Ralf Herbrich, and the anonymous ACL reviewers for their valuable inputs. ...
doi:10.18653/v1/p17-2084
dblp:conf/acl/TenevaC17
fatcat:jpdhxmfiznchtf3kaqsl4sefkm
The Universal Trust Machine: A survey on the Web3 path towards enabling long term digital cooperation through decentralised trust
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
However, as recent events have shown, allowing for-profit corporations to act as gatekeepers to the online world comes with a litany of problems. ...
In order to do so, we first motivate the decades-old problem of generating trust without an intermediary by discussing Robert Axelrod's research on the evolution of cooperation. ...
The Prisoner's Dilemma is a popular game analyzed in game theory where two rational agents are faced with a dilemma, they are arrested by the police and have to individually decide to either cooperate ...
arXiv:2301.06938v1
fatcat:i2z2fmazqncwfmpkycxtqvk5ai
Cooperative Open-ended Learning Framework for Zero-shot Coordination
[article]
2024
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2024; you can also visit the original URL.
The file type is application/pdf.
Other Versions
However, these approaches can result in a loss of learning and an inability to cooperate with certain strategies within the population, known as cooperative incompatibility. ...
We further specify the framework and propose a practical algorithm that leverages knowledge from game theory and graph theory. ...
The authors also thank Xihuai Wang for his kind assistance and advice. ...
arXiv:2302.04831v4
fatcat:qkvmqpi2t5aojbimkamwyelg7a
MANET Performance Optimization Using Network-Based Criteria and Unmanned Aerial Vehicles
2021
Journal of Sensor and Actuator Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We build upon our previous results devoted to the application of game-theoretic methods for computing optimal strategies. ...
In this contribution we consider the problem of optimal drone positioning for improving the operation of a mobile ad hoc network. ...
Introduction In this paper we consider the problem of optimizing information transmission in self-organizing networks of various configurations using a game-theoretic approach. ...
doi:10.3390/jsan10010008
fatcat:hk7w52uzsrgy3kexfbnae4qrra
Choosing Optimal Seed Nodes in Competitive Contagion
2019
Frontiers in Big Data
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In recent years there has been a growing interest in simulating competitive markets to find out the efficient ways to advertise a product or spread an ideology. ...
Each node is assigned a price tag to become an initial advertiser which varies according to their importance in the network. ...
Indeed, one approach used to make the influence maximization is to reduce the problem into the ranking of the nodes according to the centrality measures. ...
doi:10.3389/fdata.2019.00016
pmid:33693339
pmcid:PMC7931913
fatcat:epm3xi5ktvak5csf6qdewkjlyi
« Previous
Showing results 1 — 15 out of 746 results