WINE
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
WINE
2007
Springer
13 years 10 months ago
2007
Springer
A function is non-cooperative computable [NCC] if honest agents can compute it by reporting truthfully their private inputs, while unilateral deviations by the players are not bene...
WINE
2007
Springer
13 years 10 months ago
2007
Springer
WINE
2007
Springer
13 years 10 months ago
2007
Springer
We consider a crucial aspect of displaying advertisements on the internet: the individual user. In particular, we consider ad fatigue, where a user tires of an advertisement as it ...
WINE
2007
Springer
13 years 10 months ago
2007
Springer
When users click on poor quality advertisements, there is a hidden cost to the search engine due to the user dissatisfaction (for instance, users are less likely to click on ads in...
WINE
2007
Springer
13 years 10 months ago
2007
Springer
We study keyword auctions in a model where each advertiser has a value for every slot, which is not necessarily proportional to the number of clicks the advertiser expects to rece...
WINE
2007
Springer
13 years 10 months ago
2007
Springer
We consider the problem of designing auctions with worst case revenue guarantees for sponsored search. This problem differs from previous work because of ad dependent clickthroug...
WINE
2007
Springer
13 years 10 months ago
2007
Springer
WINE
2007
Springer
13 years 10 months ago
2007
Springer
We examine a formal model of sponsored search in which advertisers can bid not only on search terms, but on search terms under specific contexts. A context is any auxiliary infor...
WINE
2007
Springer
13 years 10 months ago
2007
Springer
We observe that ranking systems—a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz—and tournament solutions—a well...