1195 search results - page 180 / 239 » On allocations that maximize fairness |
ALT
2010
Springer
13 years 12 months ago
2010
Springer
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
AIPS
2006
13 years 11 months ago
2006
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We exhibit incentive compatible multi-unit auctions that are not affine maximizers (i.e. are not of the VCG family) and yet approximate the social welfare to within a factor of 1 ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
For a fading Gaussian multiple access channel with user cooperation, we obtain the optimal power allocation policies that maximize the rates achievable by block Markov superpositi...