• Publications
  • Influence
Spawn: A Distributed Computational Economy
TLDR
Using concurrent Monte Carlo simulations as prototypical applications, the authors explore issues of fairness in resource distribution, currency as a form of priority, price equilibria, the dynamics of transients, and scaling to large systems.
Using a model of social dynamics to predict popularity of news
TLDR
It is shown that stochastic models of user behavior on these sites allows predicting popularity based on early user reactions to new content, and that incorporating aspects of the web site design improves on predictions based on simply extrapolating from the early votes.
An Economics Approach to Hard Computational Problems
TLDR
This method, based on notions of risk in economics, offers a computational portfolio design procedure that can be used for a wide range of problems, including the combinatorics of DNA sequencing and the completion of tasks in environments with resource contention, such as the World Wide Web.
The DARPA Twitter Bot Challenge
TLDR
There is a need to identify and eliminate "influence bots" - realistic, automated identities that illicitly shape discussions on sites like Twitter and Facebook - before they get too influential.
Exploiting the Deep Structure of Constraint Problems
TLDR
A technique for analyzing the behavior of sophisticated AI search programs working on realistic, large-scale problems is introduced and it is suggested that this type of analysis can be generalized to other kinds of AI problems.
Enhancing privacy and trust in electronic communities
TLDR
This work proposes new non-third party mechanisms to overcome barriers to finding shared preferences, discovering communities with shared values, removing disincentives posed by liabilities, and negotiating on behalf of a group.
The Hardest Constraint Problems: A Double Phase Transition
TLDR
The distribution of hard graph coloring problems as a function of graph connectivity is shown to have two distinct transition behaviors, including a peak in the median search cost near the connectivity at which half the graphs have solutions.
Controlling chaos in distributed systems
  • T. Hogg, B. Huberman
  • Mathematics, Computer Science
    IEEE Trans. Syst. Man Cybern.
  • 1 November 1991
TLDR
A simple and robust procedure for freezing out chaotic behavior in systems composed of interacting agents making decisions based on imperfect and delayed information is described, which generates a diverse population out of an essentially homogeneous one.
Phase Transitions and the Search Problem
TLDR
Techniques that were originally developed in statistical mechanics can be applied to search problems that arise commonly in artificial intelligence and predict that abrupt changes in computational cost should occur universally, as heuristic effectiveness or search space topology is varied.
Effects of feedback and peer pressure on contributions to enterprise social media
TLDR
The impact attention, feedback, and managers' and coworkers' participation have on employees' behavior is analyzed and feedback in the form of posted comments is highly correlated with a user's subsequent participation in social media.
...
1
2
3
4
5
...