( en | de | ru )

 

Disambiguation of "Sandholm, Tuomas"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithm for optimal winner determination in combinatorial auctions

. Artificial Intelligence, (2002)

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

Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation., and . Computing and Markets, volume 05011 of Dagstuhl Seminar Proceedings, IBFI, Schloss Dagstuhl, Germany, (2005)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)Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, (2002)Automated contracting in distributed manufacturing among independent companies.. J. Intell. Manuf., 11 (3): 271-283 (2000)Smoothing Techniques for Computing Nash Equilibria of Sequential Games., , , and . Math. Oper. Res., 35 (2): 494-512 (2010)Failure-aware kidney exchange., , and . EC, page 323-340. ACM, (2013)Agent-Mediated Electronic Commerce: Issues, Challenges and Some Viewpoints., , , , , and . Agents, page 189-196. ACM, (1998)Communication complexity as a lower bound for learning in games., and . ICML, volume 69 of ACM International Conference Proceeding Series, ACM, (2004)Generalizing preference elicitation in combinatorial auctions., and . AAMAS, page 1014-1015. ACM, (2003)