Sciweavers

303 search results - page 1 / 61
» Incentive analysis of approximately efficient allocation alg...
Sort
View
ATAL
2010
Springer
13 years 5 months ago
Incentive analysis of approximately efficient allocation algorithms
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...
Yevgeniy Vorobeychik, Yagil Engel
ATAL
2010
Springer
13 years 5 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 4 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
AAAI
2010
13 years 6 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie
ICNP
2002
IEEE
13 years 9 months ago
Incentive Engineering in Wireless LAN Based Access Networks
Traffic regulation in public and private wireless LANs face a number of significant challenges, particularly in commercial networks where there is a need for efficient regulati...
Raymond R.-F. Liao, Rita H. Wouhaybi, Andrew T. Ca...