The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
We define trust-based mechanism design as an augmentation of traditional mechanism design in which agents take into account the degree of trust that they have in their counterpar...
Rajdeep K. Dash, Sarvapali D. Ramchurn, Nicholas R...
ABSTRACT: We examine an environment where goods and privately informed buyers arrive stochastically to a market. A seller in this setting faces a sequential allocation problem with...
We consider a problem where two selfish cognitive radio users try to share two channels on which they each have potentially different valuations. We first formulate the problem as ...
Hua Liu, Allen B. MacKenzie, Bhaskar Krishnamachar...
We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) inc...