activity
19972008
most citedThreshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication

51 citations · 165 across the 19 of their papers we have counts for

collaborators
Showing cs.GTShow all

5 papers · 1 filter

cs.GT20087 cited

To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?

Sudhir Kumar Singh, Vwani P. Roychowdhury

We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match-a feature where an ad of an advertiser can be mapped to a bro…

cs.GT2007

Capacity as a Fundamental Metric for Mechanism Design in the Information Economy

Sudhir Kumar Singh, Vwani P. Roychowdhury

The auction theory literature has so far focused mostly on the design of mechanisms that takes the revenue or the efficiency as a yardstick. However, scenarios where the {\it capac…

cs.GT2007

Diversification in the Internet Economy:The Role of For-Profit Mediators

Sudhir Kumar Singh, Vwani P. Roychowdhury, Himawan Gunadhi +1

We investigate market forces that would lead to the emergence of new classes of players in the sponsored search market. We report a 3-fold diversification triggered by two inherent…

cs.GT2007

Capacity constraints and the inevitability of mediators in adword auctions

Sudhir Kumar Singh, Vwani P. Roychowdhury, Himawan Gunadhi +1

One natural constraint in the sponsored search advertising framework arises from the fact that there is a limit on the number of available slots, especially for the popular keyword…

cs.GT2007

For-profit mediators in sponsored search advertising

Sudhir Kumar Singh, Vwani P. Roychowdhury, Himawan Gunadhi +1

A mediator is a well-known construct in game theory, and is an entity that plays on behalf of some of the agents who choose to use its services, while the rest of the agents partic…