Michael Kearns

Moez Draief

Proceedings of the 30th International Conference on Machine Learning, 2013

Depth-Workload Tradeoffs for Workforce Organization.

[BibT_eX]

[DOI]

Hoda Heidari

Proceedings of the First AAAI Conference on Human Computation and Crowdsourcing, 2013

2012

Experiments in social computation.

[BibT_eX]

[DOI]

Commun. ACM, 2012

Colonel Blotto on Facebook: the effect of social relations on strategic interaction.

[BibT_eX]

[DOI]

Proceedings of the Web Science 2012, 2012

Budget Optimization for Sponsored Search: Censored Learning in MDPs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Competitive contagion in networks.

[BibT_eX]

[DOI]

Sanjeev Goyal

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Behavioral experiments on a network formation game.

[BibT_eX]

[DOI]

Yevgeniy Vorobeychik

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Experiments in social computation: (and the data they generate).

[BibT_eX]

[DOI]

Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Learning and predicting dynamic networked behavior with graphical multiagent models.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

Bandits, Query Learning, and the Haystack Dimension.

[BibT_eX]

[DOI]

Kareem Amin

Umar Syed

Proceedings of the COLT 2011, 2011

Behavioral Conflict and Fairness in Social Networks.

[BibT_eX]

[DOI]

Yevgeniy Vorobeychik

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Graphical Models for Bandit Problems.

[BibT_eX]

[DOI]

Kareem Amin

Umar Syed

Proceedings of the UAI 2011, 2011

Market making and mean reversion.

[BibT_eX]

[DOI]

Tanmoy Chakraborty

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

A Clustering Coefficient Network Formation Game.

[BibT_eX]

[DOI]

Michael Brautbar

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

Behavioral dynamics and influence in networked coloring and consensus.

[BibT_eX]

[DOI]

Yevgeniy Vorobeychik

Proc. Natl. Acad. Sci. USA, 2010

Censored exploration and the dark pool problem.

[BibT_eX]

[DOI]

Kuzman Ganchev

Yuriy Nevmyvaka

Jennifer Wortman Vaughan

Commun. ACM, 2010

A behavioral study of bargaining in social networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Local Algorithms for Finding Interesting Individuals in Large Networks.

[BibT_eX]

[DOI]

Mickey Brautbar

Proceedings of the Innovations in Computer Science, 2010

Private and Third-Party Randomization in Risk-Sensitive Equilibrium Concepts.

[BibT_eX]

[DOI]

Mickey Brautbar

Umar Syed

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Behavioral experiments on biased voting in networks.

[BibT_eX]

[DOI]

Proc. Natl. Acad. Sci. USA, 2009

Network bargaining: algorithms and structural results.

[BibT_eX]

[DOI]

Tanmoy Chakraborty

Sanjeev Khanna

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

2008

Regret to the best vs. regret to the average.

[BibT_eX]

[DOI]

Mach. Learn., 2008

Learning from Multiple Sources.

[BibT_eX]

[DOI]

Koby Crammer

J. Mach. Learn. Res., 2008

Biased Voting and the Democratic Primary Problem.

[BibT_eX]

[DOI]

Jinsong Tan

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Bargaining Solutions in a Social Network.

[BibT_eX]

[DOI]

Tanmoy Chakraborty

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Behavioral experiments in networked trade.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Learning from Collective Behavior.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007

Empirical Price Modeling for Sponsored Search.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Sponsored Search with Contexts.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

A network formation game for bipartite exchange economies.

[BibT_eX]

[DOI]

Siddharth Suri

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Privacy-Preserving Belief Propagation and Sampling.

[BibT_eX]

[DOI]

Jinsong Tan

Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2006

Cobot in LambdaMOO: An Adaptive Social Statistics Agent.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2006

Networks preserving evolutionary equilibria and the power of randomization.

[BibT_eX]

[DOI]

Siddharth Suri

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

(In)Stability properties of limit order dynamics.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

A Small World Threshold for Economic Network Formation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 19, 2006

Reinforcement learning for optimized trade execution.

[BibT_eX]

[DOI]

Yuriy Nevmyvaka

Yi Feng

Proceedings of the Machine Learning, 2006

Risk-Sensitive Online Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005

Electronic Trading in Order-Driven Markets: Efficient Execution.

[BibT_eX]

[DOI]

Proceedings of the 7th IEEE International Conference on E-Commerce Technology (CEC 2005), 2005

Learning from Data of Variable Quality.

[BibT_eX]

[DOI]

Koby Crammer

Proceedings of the Advances in Neural Information Processing Systems 18 [Neural Information Processing Systems, 2005

Trading in Markovian Price Models.

[BibT_eX]

[DOI]

Sham M. Kakade

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004

Competitive algorithms for VWAP and limit order trading.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Economic Properties of Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Graphical Economics.

[BibT_eX]

[DOI]

Sham M. Kakade

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003

The Penn-Lehman Automated Trading Project.

[BibT_eX]

[DOI]

IEEE Intell. Syst., 2003

Structured interaction in game theory.

[BibT_eX]

[DOI]

Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2003), 2003

Correlated equilibria in graphical games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Algorithms for Interdependent Security Games.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

Exploration in Metric State Spaces.

[BibT_eX]

[DOI]

Sham M. Kakade

John Langford

Proceedings of the Machine Learning, 2003

2002

Near-Optimal Reinforcement Learning in Polynomial Time.

[BibT_eX]

[DOI]

Mach. Learn., 2002

A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes.

[BibT_eX]

[DOI]

Mach. Learn., 2002

Optimizing Dialogue Management with Reinforcement Learning: Experiments with the NJFun System.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2002

Efficient Nash Computation in Large Population Games with Bounded Influence.

[BibT_eX]

[DOI]

Proceedings of the UAI '02, 2002

Nash Propagation for Loopy Graphical Games.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems, 2002

A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems, 2002

CobotDS: A Spoken Dialogue System for Chat.

[BibT_eX]

[DOI]

Diane J. Litman

Jessica Howe

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001

ATTac-2000: An Adaptive Autonomous Bidding Agent.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2001

Graphical Models for Game Theory.

[BibT_eX]

[DOI]

Michael L. Littman

Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001

An Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games.

[BibT_eX]

[DOI]

Michael L. Littman

Proceedings of the Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, 2001

Cobot: A Social Reinforcement Learning Agent.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, 2001

Computational Game Theory and AI.

[BibT_eX]

[DOI]

Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001

A social reinforcement learning agent.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Autonomous Agents, 2001

2000

Testing Problems with Sublearning Sample Complexity.

[BibT_eX]

[DOI]

Dana Ron

J. Comput. Syst. Sci., 2000

Nash Convergence of Gradient Dynamics in General-Sum Games.

[BibT_eX]

[DOI]

Proceedings of the UAI '00: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence, Stanford University, Stanford, California, USA, June 30, 2000

Fast Planning in Stochastic Games.

[BibT_eX]

[DOI]

Proceedings of the UAI '00: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence, Stanford University, Stanford, California, USA, June 30, 2000

A Boosting Approach to Topic Spotting on Subdialogues.

[BibT_eX]

Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29, 2000

Bias-Variance Error Bounds for Temporal Difference Updates.

[BibT_eX]

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

Automatic Optimization of Dialogue Management.

[BibT_eX]

[DOI]

Proceedings of the COLING 2000, 18th International Conference on Computational Linguistics, Proceedings of the Conference, 2 Volumes, July 31, 2000

Empirical Evaluation of a Reinforcement Learning Spoken Dialogue System.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

Cobot in LambdaMOO: A Social Statistics Agent.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999

Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation.

[BibT_eX]

[DOI]

Dana Ron

Neural Comput., 1999

On the Boosting Ability of Top-Down Decision Tree Learning Algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

Reinforcement Learning for Spoken Dialogue Systems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 12, [NIPS Conference, Denver, Colorado, USA, November 29, 1999

Approximate Planning in Large POMDPs via Reusable Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 12, [NIPS Conference, Denver, Colorado, USA, November 29, 1999

Efficient Reinforcement Learning in Factored MDPs.

[BibT_eX]

[DOI]

Daphne Koller

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Automatic Detection of Poor Speech Recognition at the Dialogue Level.

[BibT_eX]

[DOI]

Diane J. Litman

Marilyn A. Walker

Michael S. Kearns

Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics, 1999

1998

Efficient Noise-Tolerant Learning from Statistical Queries.

[BibT_eX]

[DOI]

J. ACM, 1998

Large Deviation Methods for Approximate Probabilistic Inference.

[BibT_eX]

[DOI]

Lawrence K. Saul

Proceedings of the UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 1998

Exact Inference of Hidden Structure from Sample Data in noisy-OR Networks.

[BibT_eX]

[DOI]

Proceedings of the UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 1998

Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 11, [NIPS Conference, Denver, Colorado, USA, November 30, 1998

Inference in Multilayer Networks via Large Deviation Bounds.

[BibT_eX]

[DOI]

Lawrence K. Saul

Proceedings of the Advances in Neural Information Processing Systems 11, [NIPS Conference, Denver, Colorado, USA, November 30, 1998

Near-Optimal Reinforcement Learning in Polynominal Time.

[BibT_eX]

Proceedings of the Fifteenth International Conference on Machine Learning (ICML 1998), 1998

A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization.

[BibT_eX]

Proceedings of the Fifteenth International Conference on Machine Learning (ICML 1998), 1998

Theoretical Issues in Probabilistic Artificial Intelligence.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Testing Problems with Sub-Learning Sample Complexity.

[BibT_eX]

[DOI]

Dana Ron

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering.

[BibT_eX]

[DOI]

Proceedings of the Learning in Graphical Models, 1998

1997

A Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with Consequences for the Training-test Split.

[BibT_eX]

[DOI]

Neural Comput., 1997

An Experimental and Theoretical Comparison of Model Selection Methods.

[BibT_eX]

[DOI]

Mach. Learn., 1997

Efficient Learning of Typical Finite Automata from Random Walks.

[BibT_eX]

[DOI]

Inf. Comput., 1997

An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering.

[BibT_eX]

[DOI]

Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997

1996

Rigorous Learning Curve Bounds from Statistical Mechanics.

[BibT_eX]

[DOI]

Mach. Learn., 1996

Applying the Waek Learning Framework to Understand and Improve C4.5.

[BibT_eX]

Thomas G. Dietterich

Proceedings of the Machine Learning, 1996

Boosting Theory Towards Practice: Recent Developments in Decision Tree Induction and the Weak Learning Framework.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

On the Sample Complexity of Weakly Learning

[BibT_eX]

[DOI]

Inf. Comput., March, 1995

Computational Learning Theory.

[BibT_eX]

[DOI]

Umesh V. Vazirani

SIGACT News, 1995

Learning from a Population of Hypotheses.

[BibT_eX]

[DOI]

H. Sebastian Seung

Mach. Learn., 1995

On the Complexity of Teaching.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Horn Approximations of Empirical Data.

[BibT_eX]

[DOI]

Henry A. Kautz

Bart Selman

Artif. Intell., 1995

Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Toward Efficient Agnostic Learning.

[BibT_eX]

[DOI]

Linda Sellie

Mach. Learn., 1994

Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension.

[BibT_eX]

[DOI]

David Haussler

Mach. Learn., 1994

Efficient Distribution-Free Learning of Probabilistic Concepts.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Cryptographic Limitations on Learning Boolean Formulae and Finite Automata.

[BibT_eX]

[DOI]

Leslie G. Valiant

J. ACM, 1994

Learning Boolean Formulas.

[BibT_eX]

[DOI]

Ming Li

Leslie G. Valiant

J. ACM, 1994

On the learnability of discrete distributions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Weakly learning DNF and characterizing statistical query learning using Fourier analysis.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

An Introduction to Computational Learning Theory.

[BibT_eX]

[DOI]

Umesh V. Vazirani

MIT Press, ISBN: 978-0-262-11193-5, 1994

1993

Learning in the Presence of Malicious Errors.

[BibT_eX]

[DOI]

Ming Li

SIAM J. Comput., 1993

Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Cryptographic Primitives Based on Hard Learning Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1993

Reasoning With Characteristic Models.

[BibT_eX]

[DOI]

Henry A. Kautz

Bart Selman

Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992

Oblivious PAC Learning of Concept Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991

Equivalence of Models for Polynomial Learnability

[BibT_eX]

[DOI]

Inf. Comput., December, 1991

Estimating Average-Case Learning Curves Using Bayesian, Statistical Physics and VC Dimension Methods.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 4, 1991

1990

Efficient Distribution-free Learning of Probabilistic Concepts (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Exact Identification of Circuits Using Fixed Points of Amplification Functions (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Efficient Distribution-Free Learning of Probabilistic Concepts (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

Exact Identification of Circuits Using Fixed Points of Amplification Functions (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

On the Sample Complexity of Weak Learning.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

Computational complexity of machine learning.

[BibT_eX]

ACM distinguished dissertations, MIT Press, ISBN: 978-0-262-11152-2, 1990

1989

A General Lower Bound on the Number of Examples Needed for Learning

[BibT_eX]

[DOI]

Inf. Comput., September, 1989

A Polynomial-Time Algorithm for Learning <i>k-</i>Variable Pattern Languages from Examples.

[BibT_eX]

[DOI]

Leonard Pitt

Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988

Learning in the Presence of Malicious Errors (Extended Abstract)

[BibT_eX]

[DOI]