Author of the publication

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.

 

Other publications of authors with the same name

The communication complexity of local search., , and . STOC, page 650-661. ACM, (2019)Combinatorial Auctions with Decreasing Marginal Utilities, , and . CoRR, (2002)When is it best to best-respond?, , , and . SIGecom Exch., 10 (2): 16-18 (2011)Symmetric Logspace is Closed Under Complement., and . Chic. J. Theor. Comput. Sci., (1995)On data structures and asymmetric communication complexity., , , and . STOC, page 103-111. ACM, (1995)Free-Riding and Free-Labor in Combinatorial Agency., , and . SAGT, volume 5814 of Lecture Notes in Computer Science, page 109-121. Springer, (2009)Mixed Strategies in Combinatorial Agency., , and . WINE, volume 4286 of Lecture Notes in Computer Science, page 353-364. Springer, (2006)Multi-unit Auctions with Budget Limits., , and . FOCS, page 260-269. IEEE Computer Society, (2008)Auctions with Severely Bounded Communication., and . FOCS, page 406-415. IEEE Computer Society, (2002)Towards a Characterization of Truthful Combinatorial Auctions., , and . FOCS, page 574-583. IEEE Computer Society, (2003)