Uri Nadav

Details der Publikationsliste

Zeitraum

2005 - 2009

Anzahl

8

Co-Autoren

Quasi-Proportional Mechanisms: Prior-free Revenue Maximization (2009)

Mirrokni, Vahab, Muthukrishnan, S., Nadav, Uri

Inspired by Internet ad auction applications, we study the problem of allocating a single item via an auction when bidders place very different values on the item. We formulate this as the problem of...

Bid Optimization in Broad-Match Ad auctions (2009)

Even-dar, Eyal, Mansour, Yishay, Mirrokni, Vahab, Muthukrishnan, S., Nadav, Uri

Ad auctions in sponsored search support ``broad match'' that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to...

Efficient Contention Resolution Protocols for Selfish Agents (2008)

Amos Fiat, Yishay Mansour, Uri Nadav

“Alright people, listen up. The harder you push, the faster we will all get out of here.” Police Chief Wiggum to crowd in post office at tax filing deadline — The Simpsons We seek to understand...

Competitive Queue Management for Latency Sensitive Packets (2008)

Fiat, Amos, Mansour, Yishay, Nadav, Uri

queue management. An online sequence of packets arrive, each of which has an associated intrinsic value. Packets can be accepted to a FIFO queue, or discarded. The profit gained by transmitting a...

Efficient Contention Resolution Protocols for Selfish Agents (2007)

Amos Fiat, Yishay Mansour, Uri Nadav

“Alright people, listen up. The harder you push, the faster we will all get out of here.” Police Chief Wiggum to crowd in post office at tax filing deadline — The Simpsons We seek to understand...

Fault-Tolerant Storage and Quorum Systems for Dynamic Environments M.Sc. Thesis (2005)

Uri Nadav, Advisor Moni Naor

We deal with storage systems and quorum systems for a dynamic environment where servers may join and leave the system. We suggest a file storage system construction based on the ‘And-Or ’ quorum...

The dynamic and-or quorum system (2005)

Uri Nadav, Moni Naor

Abstract. We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze the...