Computational Challenges in (2009)
Joan Feigenbaum, David C. Parkes, David M. Pennock
review articles doi:10.1145/1435417.1435435 Economic and social sciences will drive Internet protocols and services into the future.
Yiling Chen, Lance Fortnow, David M. Pennock
We discuss the design of combinatorial betting mechanisms. We characterize the computational complexity of several variants of the problem and pose some oepn research questions.
Complexity of Combinatorial Market Makers ∗ (2008)
Yiling Chen, David M. Pennock, Lance Fortnow, Jennifer Wortman, Nicolas Lambert
We analyze the computational complexity of market maker pricing algorithms for combinatorial prediction markets. We focus on Hanson’s popular logarithmic market scoring rule market maker (LMSR)....
or How To Get Everyone Else to Solve Your Intractable Problems (2008)
I discuss the prospects of opening securities markets in hard computational problems, including satisfiability, counting problems, and Bayesian inference problems. Such NP markets would offer direct...
The Self-Organized Web: The Yin to the Semantic Web’s Yang (2008)
Gary William Flake, David M. Pennock, Daniel C. Fain
dynamic, it’s decentralized—it’s unlike anything else in the world. But one of the Web’s most amazing attributes is that it is arguably the largest self-organized artifact in existence. Every...
Complexity of Combinatorial Market Makers ∗ (2008)
Yiling Chen, David M. Pennock, Lance Fortnow, Jennifer Wortman, Nicolas Lambert
We analyze the computational complexity of market maker pricing algorithms for combinatorial prediction markets. We focus on Hanson’s popular logarithmic market scoring rule market maker (LMSR)....
Yiling Chen, Lance Fortnow, David M. Pennock
We discuss the design of combinatorial betting mechanisms. We characterize the computational complexity of several variants of the problem and pose some open research questions.
Mechanism Design on Trust Networks (2008)
Arpita Ghosh, Mohammad Mahdian, Daniel M. Reeves, David M. Pennock, Ryan Fugger
Abstract. We introduce the concept of a trust network—a decentralized payment infrastructure in which payments are routed as IOUs between trusted entities. The trust network has directed links...
Lance Fortnow, Joe Kilian, David M. Pennock
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying or selling...
ABSTRACT Information Markets vs. Opinion Pools: An Empirical Comparison (2008)
Yiling Chen, Chao-hsien Chu, Tracy Mullen, David M. Pennock
In this paper, we examine the relative forecast accuracy of information markets versus expert aggregation. We leverage a unique data source of almost 2000 people’s subjective probability judgments...
Analysis of lexical signatures for improving information persistence on the World Wide Web (2008)
David M. Pennock, C. Lee Giles, Robert Krovetz
A lexical signature (LS) consisting of several key words from a Web document is often sufficient information for finding the document later, even if its URL has changed. We conduct a large-scale...
Yiling Chen, Lance Fortnow, David M. Pennock
We discuss the design of combinatorial betting mechanisms. We characterize the computational complexity of several variants of the problem and pose some open research questions.
Mining the Web to Play “Who Wants to be a Millionaire?” Abstract (2008)
Shyong K. Lam, David M. Pennock
We exploit the redundancy and volume of information on the web to build a computerized player for the ABC TV game show “Who Wants To Be A Millionaire?”. The player consists of a questionanswering...
Categories and Subject Descriptors (2008)
Andrew I. Schein, Rin Popescul, Lyle H. Ungar, David M. Pennock
Probability And Statistics—Contingency table analysis We have developed a method for recommending items that combines content and collaborative data under a single probabilistic framework. We...
Inferring Hierarchical, Descriptions Eric Glover, David M. Pennock, Steve Lawrence, Robert Krovetznec
CROC: A New Evaluation Criterion for Recommender Systems 1 (2008)
Andrew I. Schein, Rin Popescul, Lyle H. Ungar, David M. Pennock
Evaluation of a recommender system algorithm is a challenging task due to the many possible scenarios in which such systems may be deployed. We have designed a new performance plot called the CROC...
Mining the Web to Play “Who Wants to be a Millionaire?” Abstract (2008)
Shyong K. Lam, David M. Pennock
We exploit the redundancy and volume of information on the web to build a computerized player for the ABC TV game show “Who Wants To Be A Millionaire?”. The player consists of a questionanswering...
Probability And Statistics—Contingency table analysis (2008)
Andrew I. Schein, Rin Popescul, Lyle H. Ungar, David M. Pennock
We have developed a method for recommending items that combines content and collaborative data under a single probabilistic framework. We benchmark our algorithm against a naïve Bayes classifier on...
Yiling Chen, Lance Fortnow, David M. Pennock
We discuss the design of combinatorial betting mechanisms. We characterize the computational complexity of several variants of the problem and pose some open research questions.
Bluffing and Strategic Reticence in Prediction Markets ABSTRACT (2008)
In a prediction market using a logarithmic market scoring rule market maker, there exist joint probability distributions on signals such that agents have an incentive to bid against their own...
CROC: A New Evaluation Criterion for Recommender Systems (2008)
Andrew Schein Alexandrin, Andrew I. Schein, Rin Popescul, Lyle H. Ungar, David M. Pennock
Evaluation of a recommender system algorithm is a challenging task due to the many possible scenarios in which such systems may be deployed. We have designed a new performance plot called the CROC...
Categories and Subject Descriptors (2007)
Andrew I. Schein, Rin Popescul, Lyle H. Ungar, David M. Pennock
]: Probability And Statistics---Contingency table analysis We have developed a method for recommending items that combines content and collaborative data under a single probabilistic framework. We...
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence, David M. Pennock
Abstract. Inductive logic programming (ILP) techniques are useful for analyzing data in multi-table relational databases. Learned rules can potentially discover relationships that are not obvious in...
Soumen Chakrabartit, Mukul M. Joshi, Kunal Punera, David M. Pennock
The Xeb graph is a giaut social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, arid do not consider...
David M. Pennock, Sandip Debnath, Eric J. Glover, C. Lee Giles
We develop a model of how information ows into a market, and derive algorithms for automatically detecting and explaining relevant events. We analyze data from twenty-two \political stock markets...
]: Probability And Statistics Contin.qency table anal- (2007)
Andrew I. Schein, Rin Popescul, Lyle H. Ungar, David M. Pennock
ysis Ve have developed a method for recommending items that combines content and collaborative data under a single probabifistic framework. We benchmark our algorithm against a naYve Bayes classifier...
The Observability of Independence under Monetary-Based (2007)
David M. Pennock, Michael P. Wellman
Graphical models [1] have proved invaluable as a language for encoding probability distributions, due primarily to their facility in expressing independencies among variables. Sufficient...
Paat Rusmevichientong, David M. Pennock, Steve Lawrence, C. Lee Giles
We present two new algorithms for generating uniformly random samples of pages from the World Wide Web, building upon recent work by Henzinger et al. (Henzinger et al. 2000) and Bar-Yossef et al....
Paat Rusmevichientong, David M. Pennock, Steve Lawrence, C. Lee Giles
We present two new algorithms for generating uniformly random samples of pages from the World Wide Web, building upon recent work by Henzinger et al. (Henzinger et al. 2000) and Bar-Yossef et al....
Paat Rusmevichientong, David M. Pennock, Steve Lawrence, C. Lee Giles
We present two new algorithms for generating uniformly random samples of pages from the World Wide Web, building upon recent work by Henzinger et al. (Henzinger et al. 2000) and Bar-Yossef et al....
Winners don't take all: A model of web link accumulation (2007)
David M. Pennock, C. Lee Giles, Gary W. Flake, Steve Lawrence, Eric Glover
Several studies show that the distribution of the number of links per web page follows a power law in the limit for large numbers of links. The same power law scaling appears in the connectivity...
Informatics and Mathematical (2007)
David M. Pennock, Steve Lawrence, Dpennock Lawrence, Finn Arup Nielsen, C. Lee Giles
Game sites on the World Wide Web draw people from around the world with specialized interests, skills, and knowledge. Data from the games often re ects the players ' expertise and will to win....
or How To Get Everyone Else to Solve Your Intractable Problems (2007)
I discuss the prospects of opening securities markets in hard computational problems, including satisfiability, counting problems, and Bayesian inference problems. Such NP markets would offer direct...
David M, Eric J. Glover, Eric J. Glover, Gary W. Flake, Gary W. Flake, Steve Lawrence, ...
Users looking for documents within specific categories may have a difficult time locating valuable documents using general purpose search engines. We present an automated method for learning query...
Joan Feigenbaum, David M. Pennock, Lance Fortnow, Rahul Sami
According to economic theory, supported by empirical and laboratory evidence, the equilibrium price of a financial security reflects all of the information regarding the security’s value. We...
Bluffing and strategic reticence in prediction markets (2007)
Yiling Chen, Daniel M. Reeves, David M. Pennock, Robin D. Hanson, Lance Fortnow, Rica Gonen
Abstract. We study the equilibrium behavior of informed traders interacting with two types of automated market makers: market scoring rules (MSR) and dynamic parimutuel markets (DPM). Although both...
Juan Feng, Hemant K. Bhargava, David M. Pennock
The practice of sponsored search advertising—where advertisers pay a fee to appear alongside particular Web search results—is now one of the largest and fastest growing source of revenue for Web...
Lance Fortnow, Joe Kilian, David M. Pennock, Michael P. Wellman
We develop a framework for trading in compound securities: financial instruments that pay o # contingent on the outcomes of arbitrary statements in propositional logic. Buying or selling...
Betting Boolean-Style: A Framework for Trading in Securities Based on Logical Formulas (2004)
Lance Fortnow, Joe Kilian, David M. Pennock, Michael P. Wellman
We develop a framework for trading in compound securities: financial instruments that pay o# contingent on the outcomes of arbitrary statements in propositional logic. Buying or selling...
Lance Fortnow, Joe Kilian, David M. Pennock, Michael P. Wellman
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying or selling...
Lance Fortnow, Joe Kilian, David M. Pennock, Michael P. Wellman
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying or selling...
Omid Madani, David M. Pennock, Gary W. Flake
In the context of binary classification, we define disagreement as a measure of how often two independently-trained models differ in their classification of unlabeled data. We explore the use of...
Arnaud De Bruyn, C. Lee Giles, David M. Pennock
We propose a low-dimensional weighting scheme to map information filtering recommendations into more relevant, collaborative filtering-like recommendations. Similarly to content-based systems, the...
Comparing static and dynamic measurements and models of the internet’s topology (2004)
Seung-taek Park, David M. Pennock, C. Lee Giles
Abstract-Capturing a precise snapshot of the Internet’s topology is nearly impussihle. Recent efforts have produced autonomous-system (AS) level topologies with noticeably diver-gent...
Computation in a Distributed Information Market (2004)
Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami
According to economic theory---supported by empirical and laboratory evidence--- the equilibrium price of a financial security reflects all of the information regarding the security's value. We...
Collaborative Filtering with Maximum Entropy (2004)
Dmitry Pavlov, Eren Manavoglu, David M. Pennock, C. Lee Giles
As users navigate through online document collections on high-volume Web servers, they depend on M i n i n g t h e W e b good recommendations. The authors present a novel maximum-entropy algorithm...
A dynamic pari-mutuel market for hedging, wagering, and information aggregation (2004)
I develop a new mechanism for risk allocation and information speculation called a dynamic pari-mutuel market (DPM). A DPM acts as hybrid between a pari-mutuel market and a continuous double auction...
Statistical Relational Learning for Document Mining (2003)
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence, David M. Pennock
A major obstacle to fully integrated deployment of statistical learners is the assumption that data sits in a single table, even though most real-world databases have complex relational structures....
Computation in a distributed information market (2003)
Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami
According to economic theory---supported by empirical and laboratory evidence---the equilibrium price of a financial security reflects all of the information regarding the security's value. We...
Computation in a distributed information market (2003)
Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami
According to economic theory---supported by empirical and laboratory evidence---the equilibrium price of a financial security reflects all of the information regarding the security's value. We...
Mining the Peanut Gallery: Opinion Extraction and Semantic Classification of Product Reviews (2003)
Kushal Dave, Steve Lawrence, David M. Pennock
The web contains a wealth of product reviews, but sifting through them is a daunting task. Ideally, an opinion mining tool would process a set of search results for a given item, generating a list of...
Static and dynamic analysis of the Internet's susceptibility to faults and attacks (2003)
Seung-Taek Park, Alexy Khrabrov, David M. Pennock, Steve Lawrence, C. Lee Giles, Lyle H. Ungar
We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated data created with network...
Collaborative filtering with maximum entropy (2003)
Dmitry Pavlov, Eren Manavoglu, David M. Pennock, C. Lee Giles
Abstract — We describe a novel maximum entropy (maxent) approach for generating online recommendations as a user navigates through a collection of documents. We show how to handle high-dimensional...
Information incorporation in online in-Game sports betting markets (2003)
Sandip Debnath, David M. Pennock, C. Lee Giles, Steve Lawrence
We analyze data from $52$ online in-game sports betting markets (where betting is allowed continuously throughout a game), including 34 markets based on soccer (European football) games from the 2002...
Information Incorporation in Online In-Game Sports Betting Markets (2003)
Sandip Debnath, David M. Pennock, C. Lee Giles, Steve Lawrence, Google Inc
We analyze data from 52 online in-game sports betting markets (where betting is allowed continuously throughout a game), including 34 markets based on soccer (European football) games from the 2002...
What’s the code? automatic classification of source code archives (2002)
Secil Ugurel, Robert Krovetz, David M. Pennock, Eric J. Glover, Hongyuan Zha
There are various source code archives on the World Wide Web. These archives are usually organized by application categories and programming languages. However, manually organizing source code...
What’s the code? automatic classification of source code archives (2002)
Secil Ugurel, Robert Krovetz, C. Lee Giles, David M. Pennock, Eric J. Glover, Hongyuan Zha
There are various source code archives on the World Wide Web. These archives are usually organized by application categories and programming languages. However, manually organizing source code...
Winners don’t take all: Characterizing the competition for links on the web (2002)
David M. Pennock, Gary W. Flake, Steve Lawrence, Eric J. Glover, C. Lee Giles
As a whole, the World Wide Web displays a striking "rich get richer " behavior, with a relatively small number of sites receiving a disproportionately large share of hyperlink...
Winners don’t take all: Characterizing the competition for links on the web (2002)
David M. Pennock, Gary W. Flake, Steve Lawrence, Eric J. Glover, C. Lee Giles
As a whole, the World Wide Web displays a striking "rich get richer " behavior, with a relatively small number of sites receiving a disproportionately large share of hyperlink...
The structure of broad topics on the web (2002)
Soumen Chakrabarti, Mukul M. Joshi, Kunal Punera, David M. Pennock
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, and do not consider...
REFEREE: An open framework for practical testing of recommender systems using researchindex (2002)
Dan Cosley, Steve Lawrence, David M. Pennock
Automated recommendation (e.g., personalized product recommendation on an ecommerce web site) is an increasingly valuable service associated with many databases---typically online retail catalogs and...
Methods and metrics for cold-start recommendations (2002)
Andrew I. Schein, Rin Popescul, Lyle H. Ungar, David M. Pennock
We have developed a method for recommending items that combines content and collaborative data under a single probabilistic framework. We benchmark our algorithm against a nave Bayes classifier on...
Analysis of Lexical Signatures for Finding Lost or Related Documents (2002)
Seung-taek Park, David M. Pennock, C. Lee Giles, Robert Krovetz
A lexical signature of a web page is often sufficient for finding the page, even if its URL has changed. We conduct a largescale empirical study of eight methods for generating lexi-cal signatures,...
Towards structural logistic regression: Combining relational and statistical learning (2002)
Rin Popescul, Lyle H. Ungar, Steve Lawrence, David M. Pennock
Abstract. Inductive logic programming (ILP) techniques are useful for analyzing data in multi-table relational databases. Learned rules can potentially discover relationships that are not obvious in...
REFEREE: An open framework for practical testing of recommender systems using researchindex (2002)
Dan Cosley, Steve Lawrence, David M. Pennock
ResearchIndex
Inferring hierarchical descriptions (2002)
Eric Glover, David M. Pennock, Steve Lawrence, Robert Krovetz
We create a statistical model for inferring hierarchical term relationships about a topic, given only a small set of example web pages on the topic, without prior knowledge of any hierarchical...
Using Web Structure for Classifying and Describing Web Pages (2002)
Eric Glover Kostas, Kostas Tsioutsiouliklis, David M. Pennock
The structure of the web is increasingly being used to improve organization, search, and analysis of information on the web. For example, Google uses the text in citing documents (documents that link...
Dmitry Y. Pavlov, David M. Pennock
We develop a maximum entropy (maxent) approach to generating recommendations in the context of a user’s current navigation stream, suitable for environments where data is sparse, high-dimensional,...
A Maximum Entropy Approach To (2002)
Collaborative Filtering In, Dmitry Y. Pavlov, David M. Pennock
We develop a maximum entropy (maxent) approach to generating recommendations in the context of a user's current navigation stream, suitable for environments where data is sparse,...
Mixtures of Conditional Maximum Entropy Models (2002)
Dmitry Pavlov, Alexandrin Popescul, David M. Pennock, Lyle H. Ungar
Driven by successes in several application areas, maximum entropy modeling has recently gained considerable popularity. We generalize the standard maximum entropy formulation of classi cation...
Analysis of Lexical Signatures for Finding Lost or Related Documents (2002)
Seung-taek Park, David M. Pennock, C. Lee, Giles Robert Krovetz
A lexical signature of a web page is often su cient for nding the page, even if its URL has changed. We conduct a large-scale empirical study of eight methodsfor generating lexical signatures,...
Analysis of Lexical Signatures for Finding Lost or Related Documents (2002)
Seung-taek Park, David M. Pennock, C. Lee, Giles Robert Krovetz
A lexical signature of a web page is often su cient for nding the page, even if its URL has changed. We conduct a largescale empirical study of eight methods for generating lexical signatures,...
Winners don’t take all: Characterizing the competition for links on the web (2002)
David M. Pennock, Gary W. Flake, Steve Lawrence, Eric J. Glover, C. Lee Giles
As a whole, the World Wide Web displays a striking “rich get richer ” behavior, with a relatively small number of sites receiving a disproportionately large share of hyperlink references and...
What’s the code? automatic classification of source code archives (2002)
Secil Ugurel, Robert Krovetz, C. Lee Giles, David M. Pennock, Eric Glover, Hongyuan Zha
There are various source code archives on the World Wide Web. These archives are usually organized by application categories and programming languages. However, manually organizing source code...
Methods for sampling pages uniformly from the world wide web (2001)
Paat Rusmevichientong, David M. Pennock, Steve Lawrence, C. Lee Giles
We present two new algorithms for generating uniformly random samples of pages from the World Wide Web, building upon recent work by Henzinger et al. (Henzinger et al. 2000) and Bar-Yossef et al....
Methods for sampling pages uniformly from the world wide web (2001)
Paat Rusmevichientong, David M. Pennock, Steve Lawrence, C. Lee Giles
We present two new algorithms for generating uniformly random samples of pages from the World Wide Web, building upon recent work by Henzinger et al. (Henzinger et al. 2000) and Bar-Yossef et al....
Rin Popescul, Lyle H. Ungar, David M. Pennock, Steve Lawrence
Recommender systems leverage product and community information to target products to consumers. Researchers have developed collaborative recommenders, content-based recommenders, and a few hybrid...
Generative models for cold-start recommendations (2001)
Andrew I. Schein, Rin Popescul, Lyle H. Ungar, David M. Pennock
Systems for automatically recommending items (e.g., movies, products, or information) to users are becoming increasingly important in e-commerce applications, digital libraries, and other domains...
Rin Popescul, Lyle H. Ungar, David M. Pennock, Steve Lawrence
Recommender systems leverage product and community information to target products to consumers. Researchers have developed collaborative recommenders, content-based recommenders, and a few hybrid...
Rin Popescul, Lyle H. Ungar, David M. Pennock, Steve Lawrence
Recommender systems leverage product and community information to target products to consumers. Researchers have developed collaborative recommenders, content-based recommenders, and a few hybrid...
Improving Category Specific Web Search by Learning Query Modifications (2001)
Eric Glover, Eric J. Glover, Gary Flake, Gary W. Flake, Steve Lawrence, Steve Lawrence, ...
Users looking for documents within specific categories may have a difficult time locating valuable documents using general purpose search engines. We present an automated method for learning query...
Generative Models for Cold-Start Recommendations (2001)
Andrew Schein Alexandrin, Andrew I. Schein, Rin Popescul, Lyle H. Ungar, David M. Pennock
Systems for automatically recommending items (e.g., movies, products, or information) to users are becoming increasingly important in e-commerce applications, digital libraries, and other domains...
Generative Models for Cold-Start Recommendations (2001)
Andrew Schein Alexandrin, I. Schein, Rin Popescul, David M. Pennock, Lyle H. Ungar
Systems for automatically recommending items (e.g., movies, products, or information) to users are becoming increasingly important in e-commerce applications, digital libraries, and other domains...
Persistence of Web References in Scientific Research (2001)
Steve Lawrence, David M. Pennock, Gary William Flake, Robert Krovetz, Frans M. Coetzee, Eric Glover, ...
The lack of persistence of Web references has called into question the increasingly common practice of citing URLs in scientific papers. It is argued that although few critical resources have been...
The power of play: Efficiency and forecast accuracy in web market games (2000)
David M. Pennock, Steve Lawrence, C. Lee Giles, Finn Arup Nielsen
We analyze the eciency and forecast accuracy of two market games on the World Wide Web: the Hollywood Stock Exchange (HSX) and the Foresight Exchange (FX). We quantify the degree of arbitrage...
A normative examination of ensemble learning algorithms (2000)
David M. Pennock, C. Lee Giles, Eric Horvitz
Ensemble learning algorithms combine the results of several classifiers to yield an aggregate classification. We present a normative evaluation of combination methods, applying and extending existing...
A normative examination of ensemble learning algorithms (2000)
David M. Pennock, C. Lee Giles, Eric Horvitz
Ensemble learning algorithms combine the results of several classifiers to yield an aggregate classification. We present a normative evaluation of combination methods, applying and extending existing...
The growth of Internet commerce has stimulated the use of collaborative filtering (CF) algorithms as recommender systems. Such systems leverage knowledge about the behavior of multiple users to...
David M. Pennock, Eric Horvitz, C. Lee Giles
The growth of Internet commerce has stimulated the use of collaborative filtering (CF) algorithms as recommender systems. Such systems leverage knowledge about the behavior of multiple users to...
Compact Securities Markets for Pareto Optimal Reallocation of Risk (2000)
David M. Pennock, Michael P. Wellman
The securities market is the fundamental theoretical framework in economics and finance for resource allocation under uncertainty. Securities serve both to reallocate risk and to disseminate...
Collaborative Filtering by Personality Diagnosis: A Hybrid Memory- and Model-Based Approach (2000)
The growth of Internet commerce has stimulated the use of collaborative filtering (CF) algorithms as recommender systems. Such systems leverage knowledge about the known preferences of multiple users...
Compact securities markets for Pareto optimal reallocation of risk (2000)
The securities market is the fundamental theoretical framework in economics and finance for resource allocation under uncertainty. Securities serve both to reallocate risk and to disseminate...
Analysis of the Axiomatic Foundations of Collaborative Filtering (1999)
David M. Pennock, Eric Horvitz
The growth of Internet commerce has stimulated the use of collaborative filtering (CF) algorithms as recommender systems. Such systems leverage knowledge about the behavior of multiple users to...
A Market Framework for Pooling Opinions (1998)
David M. Pennock, Michael P. Wellman
Consider a group of Bayesians, each with a subjective probability distribution over a set of uncertain events. An opinion pool derives a single consensus distribution over the events, representative...
Representing Aggregate Belief through the Competitive Equilibrium of a Securities Market (1997)
David M. Pennock, Michael P. Wellman
We consider the problem of belief aggregation: given a group of individual agents with probabilistic beliefs over a set of of uncertain events, formulate a sensible consensus or aggregate probability...
Market-Based Belief Aggregation and Group Decision Making (1997)
David M. Pennock, Edmund H. Durfee, Daniel Koditschek, Stephen M. Pollock, Advisor Michael, P. Wellman
representation of a belief aggregation function: it inputs individual probability distributions across a set of (possibly related) events--- for example concerning politics and weather---and outputs...
Exploiting a Theory of Phase Transitions in Three-Satisfiability Problems (1996)
David M. Pennock, Quentin F. Stout
In the past few years there have been several empirical discoveries of phase transitions in constraint satisfaction problems (CSPs), and a growth of interest in the area among the artificial...
David M. Pennock, Quentin Stout
In the past few years there have been several empirical discoveries of phase transitions in constraint satisfaction problems (CSPs), and a growth of interest in the area among the artificial...