—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...
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,...
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...
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...
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...