Sciweavers

166 search results - page 33 / 34
» On Allocating Goods to Maximize Fairness
Sort
View
IEEEPACT
2006
IEEE
14 years 1 months ago
Architectural support for operating system-driven CMP cache management
The role of the operating system (OS) in managing shared resources such as CPU time, memory, peripherals, and even energy is well motivated and understood [23]. Unfortunately, one...
Nauman Rafique, Won-Taek Lim, Mithuna Thottethodi
SIGECOM
2010
ACM
226views ECommerce» more  SIGECOM 2010»
14 years 10 days ago
Auctions with online supply
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
Moshe Babaioff, Liad Blumrosen, Aaron Roth
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
ATAL
2007
Springer
14 years 1 months ago
Meta-level coordination for solving negotiation chains in semi-cooperative multi-agent systems
A negotiation chain is formed when multiple related negotiations are spread over multiple agents. In order to appropriately order and structure the negotiations occurring in the c...
Xiaoqin Zhang, Victor R. Lesser
ATAL
2010
Springer
13 years 8 months ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...