Sciweavers

56 search results - page 6 / 12
» Revenue maximization with a single sample
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Spatial SINR Games Combining Base Station Placement and Mobile Association
—We study in this paper the question of determining locations of base stations (BSs) that may belong to the same or to competing service providers, taking into account the impact...
Eitan Altman, Anurag Kumar, Chandramani Kishore Si...
ACMICEC
2006
ACM
157views ECommerce» more  ACMICEC 2006»
14 years 3 months ago
Adaptive mechanism design: a metalearning approach
Auction mechanism design has traditionally been a largely analytic process, relying on assumptions such as fully rational bidders. In practice, however, bidders often exhibit unkn...
David Pardoe, Peter Stone, Maytal Saar-Tsechansky,...
COR
2008
97views more  COR 2008»
13 years 10 months ago
To be fair or efficient or a bit of both
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
Moshe Zukerman, Musa Mammadov, Liansheng Tan, Irad...
ATMOS
2010
162views Optimization» more  ATMOS 2010»
13 years 7 months ago
Heuristics for the Traveling Repairman Problem with Profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...
WINE
2010
Springer
164views Economy» more  WINE 2010»
13 years 7 months ago
Incentives in Online Auctions via Linear Programming
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
Niv Buchbinder, Kamal Jain, Mohit Singh