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...
— As the number of online auction sites has increased, interest towards providing reliable summaries, reputations, about the past behaviour of sellers has risen. Existing approac...
Let A be a randomized, unlimited supply, unit demand, single-item auction, which given a bid-vector b ∈ [h]n , has expected profit E[P(b)]. Aggarwal et al. showed that given A, ...
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...