7 citations found. Retrieving documents...
L. Blumrosen, N. Nisan, and I. Segal. Multi-player and multi-round auctions with severely bounded communication. ESA 2005.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
The Communication Cost of Selshness: - Ex Post Implementation   Self-citation (Segal)   (Correct)

No context found.

L. Blumrosen, N. Nisan, and I. Segal. Multi-player and multi-round auctions with severely bounded communication. ESA 2005.


Multi-Player and Multi-Round Auctions with Severely.. - Blumrosen, Nisan, Segal (2003)   (5 citations)  Self-citation (Blumrosen Nisan Segal)   (Correct)

No context found.

Liad Blumrosen, Noam Nisan, and Ilya Segal. Multi-player and multi-round auctions with severely bounded communications, 2003. Full version. available from http://www.cs.huji.ac.il/liad.


Automated Design of Multistage Mechanisms - Tuomas Sandholm Carnegie   (Correct)

No context found.

Liad Blumrosen, Noam Nisan, and Ilya Segal. Multi-player and multi-round auctions with severely bounded communication. In ESA, pages 102--113, 2003.


D I S S E R T a T I O N - Optimal Allocation And   (Correct)

No context found.

L. Blumrosen, N. Nisan, and I. Segal. Multi-player and multi-round auctions with severely bounded communication. In 11th Annual European Symposium on Algorithms, pages 102--113, 2003.


Unknown - (2004)   (Correct)

No context found.

L. Blumrosen, N. Nisan, and I. Segal. Multi-player and multiround auctions with severely bounded communication. In Proc. of ESA 03, Budapest, Hungary, 2003.


Auction Design with Costly Preference Elicitation - Parkes (2003)   (3 citations)  (Correct)

No context found.

Blumrosen, L., N. Nisan, and I. Segal: 2003, `Multi-Player and Multi-Round Auctions with Severely Bounded Communication'. In: Proc. 11th Annual European Symposium on Algorithms.


An Incremental Elicitation Approach To Limited-Precision - Alexander   (Correct)

No context found.

Liad Blumrosen, Noam Nisan, and Ilya Segal. Multi-player and multi-round auctions with severely bounded communication. In 11th Annual European Symposium on Algorithms (ESA 03), Budapest, Hungary, September 2003.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC