( en | de | ru )

 

Disambiguation of "Sandholm, Tuomas"

Author of the publication

copydeleteadd this publication to your clipboard
Scalable Mechanism Design for Multi-Agent Path Finding.

, , , , , , , and . CoRR, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tuomas Aittomäki

Tuomas Kortelainen

Tuomas Melkas

Tuomas Heikkilä

Tuomas Tirronen

 

Other publications of authors with the same name

Partial-revelation VCG mechanisms for combinatorial auctions, and . Eighteenth National Conference on Artificial Intelligence, page 367-372. Edmonton, (2002)Automated Market Makers That Enable New Settings: Extending Constant-Utility Cost Functions., and . AMMA, volume 80 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 19-30. Springer, (2011)Automated Design of Revenue-Maximizing Combinatorial Auctions., and . Operations Research, 63 (5): 1000-1025 (2015)Unenforced E-Commerce Transactions.. IEEE Internet Comput., 1 (6): 47-54 (1997)AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents., and . Mach. Learn., 67 (1-2): 23-43 (2007)Leveled Commitment Contracts and Strategic Breach., and . Games Econ. Behav., 35 (1-2): 212-270 (2001)eMediator: A Next Generation Electronic Commerce Server.. Comput. Intell., 18 (4): 656-676 (2002)Liquidity-Sensitive Automated Market Makers via Homogeneous Risk Measures., and . WINE, volume 7090 of Lecture Notes in Computer Science, page 314-325. Springer, (2011)Limited lookahead in imperfect-information games., and . Artif. Intell., (2020)Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, (2002)