Παρακολούθηση
Tuomas Sandholm
Tuomas Sandholm
Angel Jordan University Professor of Computer Science, Carnegie Mellon University
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cs.cmu.edu - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Algorithm for optimal winner determination in combinatorial auctions
T Sandholm
Artificial Intelligence 135, 1-54, 2002
15782002
Coalition structure generation with worst case guarantees
T Sandholm, K Larson, M Andersson, O Shehory, F Tohmé
Artificial intelligence 111 (1-2), 209-238, 1999
10421999
Superhuman AI for multiplayer poker
N Brown, T Sandholm
Science 365 (6456), 885-890, 2019
9372019
Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
N Brown, T Sandholm
Science 359 (6374), 418-424, 2018
9032018
Distributed rational decision making
T Sandholm
Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence …, 1999
8271999
An implementation of the contract net protocol based on marginal cost calculations
T Sandholm
AAAI, 256-262, 1993
7621993
Coalitions among computationally bounded agents
T Sandholm, VR Lesser
Artificial Intelligence 94 (1-2), 99-137, 1997
6731997
Issues in automated negotiation and electronic commerce: Extending the contract net framework
T Sandholm, VR Lesser
ICMAS, 12-14, 1995
6421995
Computing the optimal strategy to commit to
V Conitzer, T Sandholm
Proceedings of the 7th ACM Conference on Electronic Commerce (EC), 82-90, 2006
6312006
Multiagent reinforcement learning in the iterated prisoner's dilemma
T Sandholm, RH Crites
Biosystems 37 (1), 147-166, 1996
5071996
Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges
DJ Abraham, A Blum, T Sandholm
Proceedings of the 8th ACM Conference on Electronic Commerce (EC), 295-304, 2007
4602007
A nonsimultaneous, extended, altruistic-donor chain
MA Rees, JE Kopke, RP Pelletier, DL Segev, ME Rutter, AJ Fabrega, ...
New England Journal of Medicine 360 (11), 1096-1101, 2009
4192009
When are elections with few candidates hard to manipulate?
V Conitzer, T Sandholm, J Lang
Journal of the ACM (JACM) 54 (3), 14-es, 2007
4182007
Complexity of mechanism design
V Conitzer, T Sandholm
Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence …, 2002
4022002
Reinforcement learning to play an optimal Nash equilibrium in team Markov games
X Wang, T Sandholm
Advances in neural information processing systems 15, 2002
3862002
eMediator: A next generation electronic commerce server
T Sandholm
Computational Intelligence 18 (4), 656-676, 2002
3602002
AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
V Conitzer, T Sandholm
Machine Learning 67 (1), 23-43, 2007
3582007
Winner determination in combinatorial auction generalizations
T Sandholm, S Suri, A Gilpin, D Levine
Proceedings of the First International Joint Conference on Autonomous Agents …, 2002
3312002
Complexity results about Nash equilibria
V Conitzer, T Sandholm
International Joint Conference on Artificial Intelligence (IJCAI), 2003
3292003
Contract types for satisficing task allocation
T Sandholm
Proceedings of the AAAI spring symposium: Satisficing models, 23-25, 1998
3121998
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20