In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
In previous work we have introduced a principled methodology for systematically exploring the space of bidding strategies when agents participate in a significant number of simul...
We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, ...
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...