Tad Hogg

Chemical Power for Microscopic Robots in Capillaries (2009)

Hogg, Tad, Freitas Jr, Robert A.

The power available to microscopic robots (nanorobots) that oxidize bloodstream glucose while aggregated in circumferential rings on capillary walls is evaluated with a numerical model using axial...

Stochastic Models of User-Contributory Web Sites (2009)

Hogg, Tad, Lerman, Kristina

We describe a general stochastic processes-based approach to modeling user-contributory web sites, where users create, rate and share content. These models describe aggregate measures of activity and...

Modeling Microscopic Chemical Sensors in Capillaries (2008)

Hogg, Tad

Nanotechnology-based microscopic robots could provide accurate in vivo measurement of chemicals in the bloodstream for detailed biological research and as an aid to medical treatment. Quantitative...

Nanorobotics System Simulation in 3D Workspaces with Low Reynolds Number (2008)

Adriano Cavalcanti, Tad Hogg, Bijan Shirinzadeh

We present a computational approach to enable the development of nanorobots operating in a fluid environment relevant for medical applications. Unlike the case of larger robots, the dominant forces...

Single-step quantum search using problem structure.” eprint quant-ph/9812049 (2008)

Tad Hogg

The structure of satisfiability problems is used to improve search algorithms for quantum computers and reduce their required coherence times by using only a single coherent evaluation of problem...

Emergent Structures in Modular Selforeconfigurable Robots (2008)

Hristo Bojinov, Arancha Casal, Tad Hogg

We demonstrate how simple local sensing and con-trol rules achieve useful emergent behaviors in mod-ular self-reconfigurable (metamorphic) robots. Our biologically inspired approach grows structures...

Abstract Enhancing Privacy and Trust in Electronic Communities (2008)

Bernardo A. Huberman, Matt Franklin, Tad Hogg

A major impediment to using recommendation systems and collective knowledge for electronic commerce is the reluctance of individuals to reveal preferences in order to nd groups of people that share...

J.4 [Social and Behavioral Sciences]: Economics (2008)

Tad Hogg, Lada Adamic

Economic transactions often rely on trust. For instance, sellers usually know more than buyers about items or services offered and could misrepresent them. Without trust, mutually beneficial...

Diversity of Online Community Activities (2008)

Hogg, Tad, Szabo, Gabor

Web sites where users create and rate content as well as form networks with other users display long-tailed distributions in many aspects of behavior. Using behavior on one such community site,...

Behavior of Multi-Agent Protocols Using Quantum Entanglement (2008)

Kay-yut Chen, Tad Hogg, Bernardo A. Huberman

We describe how entangled quantum states can aid in coordination, cooperation and resource allocation in multi-agent systems. These protocols provide alternatives to conventional methods, with...

Experimental Evaluation of an eBay-Style Self-Reporting Reputation Mechanism (2008)

Kay-yut Chen, Tad Hogg

Abstract. We experimentally studied the effects of a eBay-style selfreporting reputation mechanism in an double-sided exchange economy in which participants have the option of not fulfilling their...

Full paper A Framework for Quantum Search Heuristics (2007)

Tad Hogg

A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of...

Design" Training and Turnover in Organizations (2007)

Natalie S. Glance, Tad Hogg, Bernardo A. Huberman

We present a two-level model of organizational training and agent production. Managers decide whether or not to train based on both the costs of training compared to the benefits and on their...

Hewlett-Packard Laboratories (2007)

Kay-yut Chen, Tad Hogg, Nathan Wozny

We experimentally evaluate reputation mechanisms in an exchange market in which participants have the option of not fulfilling their contracts. These mechanisms vary in the information they provide...

Private Database Queries Using Quantum States with Limited Coherence Times (2007)

Hogg, Tad, Zhang, Li

We describe a method for private database queries using exchange of quantum states with bits encoded in mutually incompatible bases. For technology with limited coherence time, the database vendor...

Experiments with Probabilistic Quantum Auctions (2007)

Chen, Kay-Yut, Hogg, Tad

We describe human-subject laboratory experiments on probabilistic auctions based on previously proposed auction protocols involving the simulated manipulation and communication of quantum states....

Quantum Auctions using Adiabatic Evolution: The Corrupt Auctioneer and Circuit Implementations (2007)

Guha, Saikat, Hogg, Tad, Fattal, David, Spiller, Timothy, Beausoleil, Raymond G.

We examine a proposed auction using quantum states to represent bids and distributed adiabatic search to find the winner. When the auctioneer follows the protocol, the final measurement giving the...

Quantum Auctions (2007)

Hogg, Tad, Harsha, Pavithra, Chen, Kay-Yut

We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while...

Abstract (2007)

Tad Hogg, Pavithra Harsha, Kay-yut Chen

We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while...

Coordinating Microscopic Robots in Viscous Fluids”, Autonomous Agents and Multi-Agent (2007)

Tad Hogg

Multiagent control provides strategies for aggregating microscopic robots (“nanorobots”) in fluid environments relevant for medical applications. Unlike larger robots, viscous forces and Brownian...

Distributed Control of Microscopic Robots in Biomedical Applications (2006)

Hogg, Tad

Current developments in molecular electronics, motors and chemical sensors could enable constructing large numbers of devices able to sense, compute and act in micron-scale environments. Such...

Modeling and Mathematical Analysis of Swarms of Microscopic Robots (2006)

Galstyan, Aram, Hogg, Tad, Lerman, Kristina

The biologically-inspired swarm paradigm is being used to design self-organizing systems of locally interacting artificial agents. A major difficulty in designing swarms with desired characteristics...

Nanorobot Communication Techniques: A Comprehensive Tutorial (2006)

Adriano Cavalcanti, Tad Hogg, Bijan Shirinzadeh, Hwee C. Liaw

Abstract—This work presents chemical communication techniques for nanorobots foraging in fluid environments relevant for medical applications. Unlike larger robots, viscous forces and rapid...

How Well Do People Play a Quantum Prisoner’s Dilemma (2006)

Kay-yut Chen, Tad Hogg

Game theory suggests quantum information processing technologies could provide useful new economic mechanisms. For example, using shared entangled quantum states can alter incentives so as to reduce...

Mathematical Analysis of Multi-Agent Systems (2004)

Lerman, Kristina, Galstyan, Aram, Hogg, Tad

We review existing approaches to mathematical modeling and analysis of multi-agent systems in which complex collective behavior arises out of local interactions between many simple agents. Though the...

Quantum Solution of Coordination Problems (2004)

Bernardo A. Huberman, Tad Hogg

We present a quantum solution to coordination problems that can be implemented with existing technologies. Using the properties of entangled states, this quantum mechanism allows participants to...

Defect-tolerant logic with nanoscale crossbar circuits (2004)

Tad Hogg, Greg Snider

Crossbar architectures are one approach to molecular electronic circuits for memory and logic applications. However, currently feasible manufacturing technologies introduce numerous defects so...

Quantum Solution of Coordination Problems (2003)

Huberman, Bernardo A., Hogg, Tad

We present a quantum solution to coordination problems that can be implemented with present technologies. It provides an alternative to existing approaches, which rely on explicit communication,...

Experimental implementation of an adiabatic quantum optimization algorithm (2003)

Steffen, Matthias, Van Dam, Wim, Hogg, Tad, Breyta, Greg, Chuang, Isaac

We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight...

A Practical Quantum Mechanism for the Public Goods Game (2003)

Chen, Kay-Yut, Hogg, Tad, Beausoleil, Raymond

Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve...

Quantum solution of coordination problems (2003)

Bernardo A. Huberman, Tad Hogg

We present a quantum solution to coordination problems that can be implemented with existing technologies. Using the properties of entangled states, this quantum mechanism allows participants to...

Quantum solution of coordination problems (2003)

Bernardo A. Huberman, Tad Hogg

We present a quantum solution to coordination problems that can be implemented with existing technologies. It provides an alternative to existing approaches, which rely on explicit communication,...

Adiabatic Quantum Computing for Random Satisfiability Problems (2002)

Hogg, Tad

The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only...

Dynamics of Large Autonomous Computational Systems (2002)

Tad Hogg Bernardo, Tad Hogg, Bernardo A. Huberman, Bernardo A. Huberman

Distributedlist scal computation gives rise to a wide range of behaviors, from thesimpl to the chaotic. This diversity of behaviors stems from the fact that the agents and programs haveincompl57...

Quantum Portfolios (2001)

Maurer, Sebastian, Hogg, Tad, Huberman, Bernardo

Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can only find the solution of hard problems...

Solving Random Satisfiability Problems with Quantum Computers (2001)

Hogg, Tad

Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic...

Complexity of continuous, 3-SAT-like constraint satisfaction problems (2001)

Yi Shang, Tad Hogg

Continuous constrained optimization is at the core of many real-world applications such as planning, scheduling, control, and diagnosis of physical systems (car, planes, factories). Effective...

Modular robot control and continuous constraint satisfaction (2001)

Tad Hogg, Yi Shang, Warren B. Jackson

Continuous constraint satisfaction is at the core of many real-world applications. One example is in the control of modular, hyper-redundant robots, which are robots with many more degrees of freedom...

Multiagent Control of Self-reconfigurable Robots (2000)

Bojinov, Hristo, Casal, Arancha, Hogg, Tad

We demonstrate how multiagent systems provide useful control techniques for modular self-reconfigurable (metamorphic) robots. Such robots consist of many modules that can move relative to each other,...

Quantum Optimization (2000)

Hogg, Tad, Portnov, Dmitriy

We present a quantum algorithm for combinatorial optimization using the cost structure of the search states. Its behavior is illustrated for overconstrained satisfiability and asymmetric traveling...

Enhancing privacy and trust in electronic communities (1999)

Bernardo A. Huberman, Matt Franklin, Tad Hogg

A major impediment to using recommendation systems and collective knowledge for electronic commerce is the reluctance of individuals to reveal preferences in order to find groups of people that share...

Solving Highly Constrained Search Problems with Quantum Computers (1999)

Tad Hogg

A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number...

Single-Step Quantum Search Using Problem Structure (1998)

Hogg, Tad

The structure of satisfiability problems is used to improve search algorithms for quantum computers and reduce their required coherence times by using only a single coherent evaluation of problem...

Tools for Quantum Algorithms (1998)

Hogg, Tad, Mochon, Carlos, Polak, Wolfgang, Rieffel, Eleanor

We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations, approximations of...

Local Search Methods for Quantum Computers (1998)

Hogg, Tad, Yanik, Mehmet

Local search algorithms use the neighborhood relations among search states and often perform well for a variety of NP-hard combinatorial search problems. This paper shows how quantum computers can...

Power Markets for Controlling Smart Matter (1997)

Guenther, Oliver, Hogg, Tad, Huberman, Bernardo A.

Embedding microscopic sensors, computers and actuators into materials allows physical systems to actively monitor and respond to their environments. This leads to the possibility of creating smart...

A Framework for Structured Quantum Search (1997)

Hogg, Tad

A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how...

A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty (1997)

Dorothy L. Mammen, Tad Hogg

The easy-hard-easy pattern in the difficulty of combinatorial search problems as constraints are added has been explained as due to a competition between the decrease in number of solutions and...

A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty (1997)

Dorothy L. Mammen, Tad Hogg

The easy-hard-easy pattern in the difficulty of combinatorial search problems as constraints are added has been explained as due to a competition between the decrease in number of solutions and...

A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty (1997)

Dorothy L. Mammen, Tad Hogg

The easy-hard-easy pattern in the di culty of combinatorial search problems as constraints are added has been explained as due to a competition between the decrease in number of solutions and...

Training and turnover in the evolution of organizations (1997)

Natalie S. Glance, Tad Hogg, Bernardo A. Huberman

We elucidate the interplay between the free rider dilemmas faced by both management and employees of a firm. Both managers and employees face a free rider dilemma: organizations can hire workers...

Controls for unstable structures (1997)

Oliver Guenther, Tad Hogg, Bernardo A. Huberman

We study the behavior of several organizations for a market based distributed control of unstable physical systems and show how a hierarchical organization is a reasonable compromise between rapid...

Quantum Smart Matter (1996)

Hogg, Tad, Chase, J. Geoffrey

The development of small-scale sensors and actuators enables the construction of smart matter in which physical properties of materials are controlled in a distributed manner. In this paper, we...

Controlling Smart Matter (1996)

Hogg, Tad, Huberman, Bernardo A.

Smart matter consists of many sensors, computers and actuators embedded within materials. These microelectromechanical systems allow properties of the materials to be adjusted under program control....

A Framework for Quantum Search Heuristics (1996)

Hogg, Tad

A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of...

Quantum Computing and Phase Transitions in Combinatorial Search (1996)

Tad Hogg

We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done...

Quantum computing and phase transitions in combinatorial search (1996)

Tad Hogg

We introduce an algorithm for combinatorial search on quantum computers that is capable of signi cantly concentrating amplitude into solutions for some NP search problems, on average. This is done by...

Quantum Computing and Phase Transitions in Combinatorial Search (1995)

Hogg, Tad

We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done...

The Instability of Markets (1995)

Hogg, Tad, Huberman, Bernardo A., Youssefmir, Michael

Recent developments in the global liberalization of equity and currency markets, coupled to advances in trading technologies, are making markets increasingly interdependent. This increased fluidity...

Communities of Practice: Performance and Evolution (1995)

Bernardo A. Huberman, Tad Hogg

We present a detailed model of collaboration in communities of practice and we examine its dynamical consequences for the group as a whole. We establish the existence of a novel mechanism that allows...

Exploiting problem structure as a search heuristic (1995)

Tad Hogg

Recent empirical and theoretical studies have shown that simple parameters characterizing constraint satisfaction problems predict whether they have a solution and the cost to solve them, on average....

Communities of Practice: Performance and Evolution (1994)

Huberman, Bernardo A., Hogg, Tad

We present a detailed model of collaboration in communities of practice and we examine its dynamical consequences for the group as a whole. We establish the existence of a novel mechanism that allows...

Bubbles and Market Crashes (1994)

Youssefmir, Michael, Huberman, Bernardo, Hogg, Tad

We present a dynamical theory of asset price bubbles that exhibits the appearance of bubbles and their subsequent crashes. We show that when speculative trends dominate over fundamental beliefs,...

Training and Turnover in Organizations (1994)

Glance, Natalie S., Hogg, Tad, Huberman, Bernardo A.

We present a two-level model of organizational training and agent production. Managers decide whether or not to train based on both the costs of training compared to the benefits and on their...

Exploiting the deep structure of constraint problems (1994)

Colin Williams, Tad Hogg

We introduce a technique for analyzing the behavior of sophisticated A.I. search programs working on realistic, large-scale problems. This approach allows us to predict where, in a space of problem...

Using Deep Structure to Locate Hard Problems (1992)

Colin P. Williams, Tad Hogg

One usually writes A.I. programs to be used on a range of examples which, although similar in kind, differ in detail. This paper shows how to predict where, in a space of problem instances, the...

Cooperative Problem Solving (1992)

Scott Clearwater Tad, Scott H. Clearwater, Tad Hogg, Bernardo A. Huberman

We present a quantitative assessment of the value of cooperation for solving constraint satisfaction problems through a series of experiments, as well as a general theory of cooperative problem...

Cooperative Problem Solving (1992)

Scott H. Clearwater, Tad Hogg, Bernardo A. Huberman

We present a quantitative assessment of the value of cooperation for solving constraint satisfaction problems through a series of experiments, as well as a general theory of cooperative problem...

Controlling chaos in distributed systems (1991)

Tad Hogg, Bernardo A. Huberman

We describe a simple and robust procedure for freezing out chaotic behavior in systems composed of interacting agents making decisions based on imperfect and delayed information. It is based on a...

Training and Turnover in Organizations

Tad Hogg, Bernardo A. Huberman

We present a two-level model of organizational training and agent production. Managers decide whether or not to train based on both the costs of training compared to the benefits and on their...

Bubbles and Market Crashes.

Youssefmir, Michael, Huberman, Bernardo A, Hogg, Tad

We present a dynamical theory of asset price bubbles that exhibits the appearance of bubbles and their subsequent crashes. We show that when speculative trends dominate over fundamental beliefs,...

Distributed Computation as an Economic System.

Huberman, Bernardo A, Hogg, Tad

As computer networks grow and blanket the planet, they become a community of concurrent processes, which, in their interactions, strategies, and lack of perfect knowledge, become analogous to human...

Bubbles and Market Crashes

Michael Youssefmir, Bernardo Huberman, Tad Hogg

We present a dynamical theory of asset price bubbles that exhibits the appearance of bubbles and their subsequent crashes. We show that when speculative trends dominate over fundamental beliefs,...

Communities of Practice: Performance and Evolution

Tad Hogg

We present a detailed model of collaboration in communities of practice and we examine its dynamical consequences for the group as a whole. We establish the existence of a novel mechanism that allows...