Sciweavers

297 search results - page 31 / 60
» On the Fastest Vickrey Algorithm
Sort
View
ATAL
2011
Springer
12 years 7 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
ATAL
2008
Springer
13 years 9 months ago
Distributed multiagent resource allocation in diminishing marginal return domains
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...
Yoram Bachrach, Jeffrey S. Rosenschein
RECOMB
2009
Springer
14 years 8 months ago
Lifting Prediction to Alignment of RNA Pseudoknots
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...
Mathias Möhl, Rolf Backofen, Sebastian Will
MOBIHOC
2009
ACM
14 years 2 months ago
Revenue generation for truthful spectrum auction in dynamic spectrum access
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...
Juncheng Jia, Qian Zhang, Qin Zhang, Mingyan Liu
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
14 years 29 days ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...