Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Eric J. Friedman"'
Autor:
Eric J. Friedman, Adam S. Landsberg
Publikováno v:
The Mathematical Gazette. 106:212-219
Many players know that the secret of winning the game of nim (and other “impartial” combinatorial games) is to write the sizes of the game’s piles in base 2 and then add them together without carry. The proof of this well-known procedure (descr
Publikováno v:
Mathematics of Operations Research. 47:945-968
A single homogeneous resource needs to be fairly shared between users that dynamically arrive and depart over time. Although good allocations exist for any fixed number of users, implementing these allocations dynamically is impractical: it typically
Autor:
Eric J Friedman, Karl Young, Graham Tremper, Jason Liang, Adam S Landsberg, Norbert Schuff, Alzheimer's Disease Neuroimaging Initiative
Publikováno v:
PLoS ONE, Vol 10, Iss 4, p e0124453 (2015)
Directed network motifs are the building blocks of complex networks, such as human brain networks, and capture deep connectivity information that is not contained in standard network measures. In this paper we present the first application of directe
Externí odkaz:
https://doaj.org/article/ee39f1d307e54591a3ca64f1f23b397f
Publikováno v:
AAAI
A cache memory unit needs to be shared among n strategic agents. Each agent has different preferences over the files to be brought into memory. The goal is to design a mechanism that elicits these preferences in a truthful manner and outputs a fair a
Autor:
Dirk Bergemann, Yotam Harchol, Michael Schapira, Nick Feamster, Aurojit Panda, Eric J. Friedman, Arvind Krishnamurthy, Sylvia Ratnasamy, Scott Shenker
Publikováno v:
SIGCOMM
This paper is focused not on the Internet architecture - as defined by layering, the narrow waist of IP, and other core design principles - but on the Internet infrastructure, as embodied in the technologies and organizations that provide Internet se
Autor:
Eric J. Friedman, Adam S. Landsberg
Publikováno v:
Theoretical Computer Science. 713:21-30
In this paper we show that a recent nearly linear time algorithm for solving a system of equations arising from a graph Laplacian can be extended to a large class of nonlinear systems of equations, based on a nonlinear generalization of the graph Lap
Autor:
Ellen Dicks, Yong He, Faisal Beg, Geert Jan Biessels, Cristian Carmeli, Guangyu Chen, Koray Çiftçi, Zhengjia Dai, Edwin Van Dellen, Martin Dyrba, Eric J. Friedman, Willem de Haan, Mahdi Jalili, Jaeseung Jeong, Yong Jeong, Tianzi Jiang, Maria G. Knyazeva, Dong Young Lee, Shi-Jiang Li, Yong Liu, Paul McCarthy, Luis Peraza Rodriguez, David Phillips, Pradeep Reddy Raamana, Yael D. Reijmer, Eun Hyun Seo, Jorge Sepulcre, Anja Soldan, John Suckling, John-Paul Taylor, Gao-Jun Teng, Alle Meije Wink, Frederik Barkhof, Philip Scheltens, Wiesje M. Van der Flier, Betty M. Tijms
Publikováno v:
Alzheimer's & Dementia. 14
Publikováno v:
ACM Transactions on Economics and Computation. 3:1-32
A game-theoretic model of scrip (artificial currency) systems is analyzed. It is shown that relative entropy can be used to characterize the distribution of agent wealth when all agents use threshold strategies---that is, they volunteer to do work if
Publikováno v:
EC
In the single-resource dynamic fair division framework there is a homogeneous resource that is shared between agents dynamically arriving and departing over time. When n agents are present, there is only one truly ``fair'' allocation: each agent rece
Publikováno v:
NeuroImage. 101:473-484
Structural and functional connectomes are emerging as important instruments in the study of normal brain function and in the development of new biomarkers for a variety of brain disorders. In contrast to single-network studies that presently dominate