Tuomas Sandholm

According to our database1, Tuomas Sandholm authored at least 303 papers between 1993 and 2020.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2008, "For contributions to combinatorial auctions and mechanism design.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Faster algorithms for extensive-form game solving via improved smoothing functions.
Math. Program., 2020

Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries.
Oper. Res., 2020

Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent.
CoRR, 2020

Small Nash Equilibrium Certificates in Very Large Games.
CoRR, 2020

Refined bounds for algorithm configuration: The knife-edge of dual class approximability.
CoRR, 2020

Sparsified Linear Programming for Zero-Sum Equilibrium Finding.
CoRR, 2020

Efficient exploration of zero-sum stochastic games.
CoRR, 2020

Stochastic Regret Minimization in Extensive-Form Games.
CoRR, 2020

Limited lookahead in imperfect-information games.
Artif. Intell., 2020

Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Coarse Correlation in Extensive-Form Games.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Failure-Aware Kidney Exchange.
Manag. Sci., 2019

Efficiency and budget balance in general quasi-linear domains.
Games Econ. Behav., 2019

How much data is sufficient to learn high-performing algorithms?
CoRR, 2019

Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Regret Circuits: Composability of Regret Minimizers.
Proceedings of the 36th International Conference on Machine Learning, 2019

Stable-Predictive Optimistic Counterfactual Regret Minimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

Deep Counterfactual Regret Minimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

Estimating Approximate Incentive Compatibility.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Quasi-Perfect Stackelberg Equilibrium.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Solving Imperfect-Information Games via Discounted Regret Minimization.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Composability of Regret Minimizers.
CoRR, 2018

A General Theory of Sample Complexity for Multi-Item Profit Maximization.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

A Unified Framework for Extensive-Form Game Abstraction with Bounds.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Solving Large Sequential Games with the Excessive Gap Technique.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Ex ante coordination and collusion in zero-sum multi-player extensive-form games.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Practical exact algorithm for trembling-hand equilibrium refinements in games.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Depth-Limited Solving for Imperfect-Information Games.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Trembling-Hand Perfection in Extensive-Form Games with Commitment.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Learning to Branch.
Proceedings of the 35th International Conference on Machine Learning, 2018

Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Multi-Organ Exchange.
J. Artif. Intell. Res., 2017

Sample Complexity of Multi-Item Profit Maximization.
CoRR, 2017

Theoretical and Practical Advances on Smoothing for Extensive-Form Games.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Safe and Nested Subgame Solving for Imperfect-Information Games.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Super-Human AI for Strategic Reasoning: Beating Top Pros in Heads-Up No-Limit Texas Hold'em.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Smoothing Method for Approximate Extensive-Form Perfect Equilibrium.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Operation Frames and Clubs in Kidney Exchange.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Libratus: The Superhuman AI for No-Limit Poker.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Regret Minimization in Behaviorally-Constrained Zero-Sum Games.
Proceedings of the 34th International Conference on Machine Learning, 2017

Reduced Space and Faster Convergence in Imperfect-Information Games via Pruning.
Proceedings of the 34th International Conference on Machine Learning, 2017

Inter-Club Kidney Exchange.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Small Representations of Big Kidney Exchange Graphs.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Safe and Nested Endgame Solving for Imperfect-Information Games.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Dynamic Thresholding and Pruning for Regret Minimization.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Exclusion Method for Finding Nash Equilibrium in Multiplayer Games.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Hardness of the Pricing Problem for Chains in Barter Exchanges.
CoRR, 2016

Efficiency and Budget Balance.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Imperfect-Recall Abstractions with Bounds in Games.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Position-Indexed Formulations for Kidney Exchange.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Sample Complexity of Automated Mechanism Design.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Scalable Segment Abstraction Method for Advertising Campaign Admission and Inventory Allocation Optimization.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Sequential Planning for Steering Immune System Adaptation.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Baby Tartanian8: Winning Agent from the 2016 Annual Computer Poker Competition.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Multi-Option Descending Clock Auction: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Exclusion Method for Finding Nash Equilibrium in Multi-Player Games: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Fast Optimal Clearing of Capped-Chain Barter Exchanges.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Strategy-Based Warm Starting for Regret Minimization in Games.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Safe Opponent Exploitation.
ACM Trans. Economics and Comput., 2015

Automated Design of Revenue-Maximizing Combinatorial Auctions.
Oper. Res., 2015

Faster First-Order Methods for Extensive-Form Game Solving.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Regret-Based Pruning in Extensive-Form Games.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Simultaneous Abstraction and Equilibrium Finding in Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Computational Bundling for Auctions.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Discretization of Continuous Action Spaces in Extensive-Form Games.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Abstraction for Solving Large Incomplete-Information Games.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Steering Evolution Strategically: Computational Game Theory and Opponent Exploitation for Treatment Planning, Drug Design, and Synthetic Biology.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Strategy-Proof and Efficient Kidney Exchange Using a Credit Mechanism.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Endgame Solving in Large Imperfect-Information Games.
Proceedings of the Computer Poker and Imperfect Information, 2015

FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent.
Proceedings of the Computer Poker and Imperfect Information, 2015

Tartanian7: A Champion Two-Player No-Limit Texas Hold'em Poker-Playing Program.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Extensive-Form Game Imperfect-Recall Abstractions With Bounds.
CoRR, 2014

Power napping with loud neighbors: optimal energy-constrained jamming and anti-jamming.
Proceedings of the 7th ACM Conference on Security & Privacy in Wireless and Mobile Networks, 2014

Optimizing prices in descending clock auctions.
Proceedings of the ACM Conference on Economics and Computation, 2014

Extensive-form game abstraction with bounds.
Proceedings of the ACM Conference on Economics and Computation, 2014

Diverse Randomized Agents Vote to Win.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Finding the pareto curve in bimatrix games is easy.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Price of fairness in kidney exchange.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Potential-Aware Imperfect-Recall Abstraction with Earth Mover's Distance in Imperfect-Information Games.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Balancing Efficiency and Fairness in Dynamic Kidney Exchange.
Proceedings of the Modern Artificial Intelligence for Health Analytics, 2014

Multi-Organ Exchange: The Whole Is Greater than the Sum of its Parts.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

The Computational Rise and Fall of Fairness.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Regret Transfer and Parameter Optimization.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
A Practical Liquidity-Sensitive Automated Market Maker.
ACM Trans. Economics and Comput., 2013

On the complexity of strong Nash equilibrium: Hard-to-solve instances and smoothed complexity
CoRR, 2013

Analysis and Optimization of Multi-Dimensional Percentile Mechanisms.
Proceedings of the IJCAI 2013, 2013

Action Translation in Extensive-Form Games with Large Action Spaces: Axioms, Paradoxes, and the Pseudo-Harmonic Mapping.
Proceedings of the IJCAI 2013, 2013

On the verification and computation of strong nash equilibrium.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Strong Nash Equilibrium Is in Smoothed P.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

Algorithms for Strong Nash Equilibrium with More than Two Agents.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates is Moderate.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012
First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games.
Math. Program., 2012

Computing optimal outcomes under an expressive representation of settings with externalities.
J. Comput. Syst. Sci., 2012

TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems Using Game Theory.
AI Magazine, 2012

Combining local search techniques and path following for bimatrix games.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Lossy stochastic game abstraction with bounds.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Profit-charging market makers with bounded loss, vanishing bid/ask spreads, and unlimited market depth.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems.
Proceedings of the Twenty-Fourth Conference on Innovative Applications of Artificial Intelligence, 2012

Mixed-bundling auctions with reserve prices.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Rational market making with probabilistic knowledge.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Strategy purification and thresholding: effective non-equilibrium approaches for playing large games.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Optimizing kidney exchange with transplant chains: theory and reality.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Towards Optimal Patrol Strategies for Fare Inspection in Transit Systems.
Proceedings of the Game Theory for Security, 2012

Optimal Auctions for Spiteful Bidders.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Dynamic Matching via Weighted Myopia with Application to Kidney Exchange.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Information-theoretic approaches to branching in search.
Discret. Optim., 2011

Expressive markets for donating to charities.
Artif. Intell., 2011

Inventory-based versus Prior-based Options Trading Agents.
Algorithmic Finance, 2011

Liquidity-Sensitive Automated Market Makers via Homogeneous Risk Measures.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Approximating Optimal Combinatorial Auctions for Complements Using Restricted Welfare Maximization.
Proceedings of the IJCAI 2011, 2011

Game theory-based opponent modeling in large imperfect-information games.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Automated Market Makers That Enable New Settings: Extending Constant-Utility Cost Functions.
Proceedings of the Auctions, Market Mechanisms, and Their Applications, 2011

A Framework for Automated Bundling and Pricing Using Purchase Data.
Proceedings of the Auctions, Market Mechanisms, and Their Applications, 2011

Strategy Purification.
Proceedings of the Applied Adversarial Reasoning and Risk Modeling, 2011

2010
Smoothing Techniques for Computing Nash Equilibria of Sequential Games.
Math. Oper. Res., 2010

Algorithms for Closed Under Rational Behavior (CURB) Sets.
J. Artif. Intell. Res., 2010

The State of Solving Large Incomplete-Information Games, and Application to Poker.
AI Magazine, 2010

Automated market-making in the large: the gates hillman prediction market.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Finding approximate competitive equilibria: efficient and fair course allocation.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

When do markets with simple agents fail?
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Decision rules and decision markets.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Combinatorial auctions with externalities.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Speeding up gradient-based algorithms for sequential games.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Computing equilibria by incorporating qualitative models?
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Automated Channel Abstraction for Advertising Auctions.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Asymmetric Spite in Auctions.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Envy Quotes and the Iterated Core-Selecting Combinatorial Auction.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
The impact of expressiveness on the effectiveness of privacy mechanisms for location-sharing.
Proceedings of the 5th Symposium on Usable Privacy and Security, 2009

Better with Byzantine: Manipulation-Optimal Mechanisms.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

How Pervasive Is the Myerson-Satterthwaite Impossibility?
Proceedings of the IJCAI 2009, 2009

Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information.
Proceedings of the IJCAI 2009, 2009

Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions.
Proceedings of the IJCAI 2009, 2009

Online Stochastic Optimization in the Large: Application to Kidney Exchange.
Proceedings of the IJCAI 2009, 2009

2008
On the Existence of Unconditionally Privacy-Preserving Auction Protocols.
ACM Trans. Inf. Syst. Secur., 2008

New complexity results about Nash equilibria.
Games Econ. Behav., 2008

GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Solving two-person zero-sum repeated games of incomplete information.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Computing Reserve Prices and Identifying the Value Distribution in Real-world Auctions with Market Disruptions.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

First-Order Algorithm with O(ln(1/e)) Convergence for e-Equilibrium in Two-Person Zero-Sum Games.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

A Theory of Expressiveness in Mechanisms.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents.
Mach. Learn., 2007

Lossless abstraction of imperfect information games.
J. ACM, 2007

When are elections with few candidates hard to manipulate?.
J. ACM, 2007

Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions.
AI Magazine, 2007

Perspectives on multiagent learning.
Artif. Intell., 2007

Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Automated Design of Multistage Mechanisms.
Proceedings of the IJCAI 2007, 2007

Incremental Mechanism Design.
Proceedings of the IJCAI 2007, 2007

07431 Abstracts Collection - Computational Issues in Social Choice.
Proceedings of the Computational Issues in Social Choice, 21.10. - 26.10.2007, 2007

07431 Executive Summary - Computational Issues in Social Choice.
Proceedings of the Computational Issues in Social Choice, 21.10. - 26.10.2007, 2007

Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

Automated Online Mechanism Design and Prophet Inequalities.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Online algorithms for market clearing.
J. ACM, 2006

Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization.
Interfaces, 2006

Side constraints and non-price attributes in markets.
Games Econ. Behav., 2006

Complexity of constructing solutions in the core based on synergies among coalitions.
Artif. Intell., 2006

Finding equilibria in large sequential games of imperfect information.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

Computing the optimal strategy to commit to.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

A technique for reducing normal-form games to compute a Nash equilibrium.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

Failures of the VCG mechanism in combinatorial auctions and exchanges.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

Expressive Commerce and Its Application to Sourcing.
Proceedings of the Proceedings, 2006

A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments.
Proceedings of the Proceedings, 2006

A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation.
Proceedings of the Proceedings, 2006

Nonexistence of Voting Rules That Are Usually Hard to Manipulate.
Proceedings of the Proceedings, 2006

Algorithms for Rationalizability and CURB Sets.
Proceedings of the Proceedings, 2006

2005
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions.
Manag. Sci., 2005

Common Voting Rules as Maximum Likelihood Estimators.
Proceedings of the UAI '05, 2005

Unconditional privacy in social choice.
Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2005), 2005

Complexity of (iterated) dominance.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

Communication complexity of common voting rules.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

A New Solution Concept for Coalitional Games in Open Anonymous Environments.
Proceedings of the New Frontiers in Artificial Intelligence, 2005

On Correctness and Privacy in Distributed Mechanisms.
Proceedings of the Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms, 2005

Efficient Privacy-Preserving Protocols for Multi-unit Auctions.
Proceedings of the Financial Cryptography and Data Security, 2005

Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation.
Proceedings of the Computing and Markets, 3.-7. January 2005, 2005

Automated Mechanism Design.
Proceedings of the Computing and Markets, 3.-7. January 2005, 2005

05011 Abstracts Collection - Computing and Markets.
Proceedings of the Computing and Markets, 3.-7. January 2005, 2005

05011 Executive Summary - Computing and Markets.
Proceedings of the Computing and Markets, 3.-7. January 2005, 2005

Spiteful Bidding in Sealed-Bid Auctions.
Proceedings of the Computing and Markets, 3.-7. January 2005, 2005

Mechanism design and deliberative agents.
Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), 2005

Decentralized voting with unconditional privacy.
Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), 2005

Coalitional Games in Open Anonymous Environments.
Proceedings of the Proceedings, 2005

Mixed-Integer Programming Methods for Finding Nash Equilibria.
Proceedings of the Proceedings, 2005

Approximating Revenue-Maximizing Combinatorial Auctions.
Proceedings of the Proceedings, 2005

Optimal Rhode Island Hold'em Poker.
Proceedings of the Proceedings, 2005

Combinatorial Auctions with <i>k-</i>wise Dependent Valuations.
Proceedings of the Proceedings, 2005

A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It.
Proceedings of the Proceedings, 2005

Expressive Negotiation in Settings with Externalities.
Proceedings of the Proceedings, 2005

2004
Preference Elicitation and Query Learning.
J. Mach. Learn. Res., 2004

Mechanism for optimally trading off revenue and efficiency in multi-unit auctions.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Strategic deliberation and truthful revelation: an impossibility result.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Revenue failures and collusion in combinatorial auctions and exchanges with vcg payments.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Computational criticisms of the revelation principle.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Self-interested automated mechanism design and implications for optimal combinatorial auctions.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Expressive negotiation over donations to charities.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Communication complexity as a lower bound for learning in games.
Proceedings of the Machine Learning, 2004

Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract).
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

Experiments on Deliberation Equilibria in Auctions.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

An Algorithm for Automatically Designing Deterministic Mechanisms without Payments.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Anonymous Pricing of Efficient Allocations in Combinatorial Economies.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Im)Possibility of Unconditionally Privacy-Preserving Auctions.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Designing Auctions for Deliberative Agents.
Proceedings of the Agent-Mediated Electronic Commerce VI, 2004

Methods for Boosting Revenue in Combinatorial Auctions.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

Using Performance Profile Trees to Improve Deliberation Control.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

Combinatorial Auctions with Structured Item Graphs.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Compressing Two-Dimensional Routing Tables.
Algorithmica, 2003

BOB: Improved winner determination in combinatorial auctions and generalizations.
Artif. Intell., 2003

Auctions with Untrustworthy Bidders.
Proceedings of the 2003 IEEE International Conference on Electronic Commerce (CEC 2003), 2003

How many candidates are needed to make elections hard to manipulate?
Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2003), 2003

On polynomial-time preference elicitation with value queries.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Auction mechanism for optimally trading off revenue and efficiency.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Solving combinatorial exchanges: optimality via a few partial bids.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Using value queries in combinatorial auctions.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Automated mechanism design for a self-interested designer.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Complexity of determining nonemptiness of the core.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Differential-revelation VCG mechanisms for combinatorial auctions.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Learning Near-Pareto-Optimal Conventions in Polynomial Time.
Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

Making Markets and Democracy Work: A Story of Incentives and Computing.
Proceedings of the IJCAI-03, 2003

Definition and Complexity of Some Basic Metareasoning Problems.
Proceedings of the IJCAI-03, 2003

Universal Voting Protocol Tweaks to Make Manipulation Hard.
Proceedings of the IJCAI-03, 2003

Complexity Results about Nash Equilibria.
Proceedings of the IJCAI-03, 2003

BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games.
Proceedings of the Machine Learning, 2003

Terminating Decision Algorithms Optimally.
Proceedings of the Principles and Practice of Constraint Programming, 2003

Automated Mechanism Design: A New Application Area for Search Algorithms.
Proceedings of the Principles and Practice of Constraint Programming, 2003

Miscomputing ratio: social cost of selfish computing.
Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems, 2003

Generalizing preference elicitation in combinatorial auctions.
Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems, 2003

Automated mechanism design: complexity results stemming from the single-agent setting.
Proceedings of the 5th International Conference on Electronic Commerce, 2003

2002
eMediator: A Next Generation Electronic Commerce Server.
Comput. Intell., 2002

Contracting With Uncertain Level Of Trust.
Comput. Intell., 2002

Leveled-Commitment Contracting: A Backtracking Instrument for Multiagent Systems.
AI Magazine, 2002

Surplus equivalence of leveled commitment contracts.
Artif. Intell., 2002

Algorithm for optimal winner determination in combinatorial auctions.
Artif. Intell., 2002

Complexity of Mechanism Design.
Proceedings of the UAI '02, 2002

Reinforcement Learning to Play an Optimal Nash Equilibrium in Team Markov Games.
Proceedings of the Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems, 2002

Market Clearing with Supply and Demand Curves.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Winner determination in combinatorial auction generalizations.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

Bidders with hard valuation problems.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

An alternating offers bargaining model for computationally limited agents.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

Incentive compatible mechanism for trust revelation.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

Effectiveness of Preference Elicitation in Combinatorial Auctions.
Proceedings of the Agent-Mediated Electronic Commerce IV, 2002

(Im)possibility of Safe Exchange Mechanism Design.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

Vote Elicitation: Complexity and Strategy-Proofness.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

Complexity of Manipulating Elections with Few Candidates.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

Partial-Revelation VCG Mechanism for Combinatorial Auctions.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
Leveled Commitment Contracts and Strategic Breach.
Games Econ. Behav., 2001

Bargaining with limited computation: Deliberation equilibrium.
Artif. Intell., 2001

Preference elicitation in combinatorial auctions.
Proceedings of the Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), 2001

CABOB: A Fast Optimal Algorithm for Combinatorial Auctions.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Market Clearability.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000
Automated contracting in distributed manufacturing among independent companies.
J. Intelligent Manufacturing, 2000

Anytime coalition structure generation: an average case study.
J. Exp. Theor. Artif. Intell., 2000

Nomad: Mobile Agent System for an Internet-Based Auction House.
IEEE Internet Comput., 2000

Issues in Computational Vickrey Auctions.
Int. J. Electron. Commer., 2000

Approaches to winner determination in combinatorial auctions.
Decis. Support Syst., 2000

Agents in Electronic Commerce: Component Technologies for Automated Negation and Coalition Formation.
Auton. Agents Multi Agent Syst., 2000

Optimal Flow Aggregation.
Proceedings of the Algorithm Theory, 2000

Safe Exchange Planner.
Proceedings of the 4th International Conference on Multi-Agent Systems, 2000

Reasoning About Others: Representing and Processing Infinite Belief Hierarchies.
Proceedings of the 4th International Conference on Multi-Agent Systems, 2000

Contract Type Sequencing for Reallocative Negotiation.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

<i>eMediator</i>: a next generation electronic commerce server.
Proceedings of the Fourth International Conference on Autonomous Agents, 2000

Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

Deliberation in Equilibrium: Bargaining in Computationally Complex Problems.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Coalition Formation Processes with Belief Revision among Bounded-rational Self-interested Agents.
J. Log. Comput., 1999

Automated Negotiation.
Commun. ACM, 1999

Coalition Structure Generation with Worst Case Guarantees.
Artif. Intell., 1999

Algorithms for Optimizing Leveled Commitment Contracts.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

An Algorithm for Optimal Winner Determination in Combinatorial Auctions.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Bargaining with Deadlines.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

Power, Dependence and Stability in Multiagent Plans.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

Time-Quality Tradeoffs in Reallocative Negotiation with Combinatorial Contract Types.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998
Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation.
Proceedings of the Third International Conference on Multiagent Systems, 1998

Leveled Commitment Contracting among Myopic Individually Rational Agents.
Proceedings of the Third International Conference on Multiagent Systems, 1998

Sequencing of Contract Types for Anytime Task Reallocation.
Proceedings of the Agent Mediated Electronic Commerce, 1998

Agent-Mediated Electronic Commerce: Issues, Challenges and Some Viewpoints.
Proceedings of the Second International Conference on Autonomous Agents, 1998

Anytime Coalition Structure Generation with Worst Case Guarantees.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

Leveled Commitment Contracts with Myopic and Strategic Agents.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
Unenforced E-Commerce Transactions.
IEEE Internet Comput., 1997

Coalitions Among Computationally Bounded Agents.
Artif. Intell., 1997

On the Gains and Losses of Speculation in Equilibrium Markets.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

1996
Advantages of a Leveled Commitment Contracting Protocol.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

A Second Order Parameter for 3SAT.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Equilibrium Analysis of the Possibilities of Unenforced Exchange in Multiagent Systems.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Coalition Formation among Bounded Rational Agents.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

On Multiagent Q-Learning in a Semi-Competitive Domain.
Proceedings of the Adaption and Learning in Multi-Agent Systems, 1995

Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework.
Proceedings of the First International Conference on Multiagent Systems, 1995

1994
Exploiting Meta-Level information in a Distributed Scheduling System.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993
An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993


  Loading...