Sciweavers

107 search results - page 7 / 22
» Design of Incentive Compatible Mechanisms for Stackelberg Pr...
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
On the Hardness of Being Truthful
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...
ATAL
2004
Springer
14 years 29 days ago
Trust-Based Mechanism Design
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...
AMMA
2009
Springer
14 years 2 months ago
Auctions with Dynamic Populations: Efficiency and Revenue Maximization
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...
Maher Said
GLOBECOM
2009
IEEE
13 years 11 months ago
Bargaining to Improve Channel Sharing between Selfish Cognitive Radios
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...
WINE
2009
Springer
182views Economy» more  WINE 2009»
14 years 2 months ago
Competitive Repeated Allocation without Payments
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...
Mingyu Guo, Vincent Conitzer, Daniel M. Reeves