( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Truthful randomized mechanisms for combinatorial auctions.

, , и . STOC, стр. 644-652. ACM, (2006)

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.

Yuval Shahar

 

Другие публикации лиц с тем же именем

Multi-unit auctions: beyond roberts., и . EC, стр. 233-242. ACM, (2011)Simplicity in Auctions Revisited: The Primitive Complexity., , и . CoRR, (2022)Two Randomized Mechanisms for Combinatorial Auctions.. APPROX-RANDOM, том 4627 из Lecture Notes in Computer Science, стр. 89-103. Springer, (2007)On the Power of Randomization in Algorithmic Mechanism Design., и . SIAM J. Comput., 42 (6): 2287-2304 (2013)Communication Complexity of Combinatorial Auctions with Submodular Valuations., и . SODA, стр. 1205-1215. SIAM, (2013)On the Power of Randomization in Algorithmic Mechanism Design., и . FOCS, стр. 505-514. IEEE Computer Society, (2009)Is Shapley Cost Sharing Optimal?, , , и . SAGT, том 4997 из Lecture Notes in Computer Science, стр. 327-336. Springer, (2008)Frequent Manipulability of Elections: The Case of Two Voters., и . WINE, том 5385 из Lecture Notes in Computer Science, стр. 653-664. Springer, (2008)Approximation algorithms for combinatorial auctions with complement-free bidders, , и . Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, стр. 610--618. (2005)On characterizations of truthful mechanisms for combinatorial auctions and scheduling., и . EC, стр. 38-47. ACM, (2008)