Sciweavers

38 search results - page 7 / 8
» First-price path auctions
Sort
View
WINE
2010
Springer
189views Economy» more  WINE 2010»
13 years 5 months ago
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swam...
PDP
2005
IEEE
14 years 1 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
AROBOTS
2011
13 years 2 months ago
Time-extended multi-robot coordination for domains with intra-path constraints
Abstract— Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect con...
Edward Gil Jones, M. Bernardine Dias, Anthony Sten...
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 7 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
QEST
2008
IEEE
14 years 2 months ago
Characterization of the E-commerce Storage Subsystem Workload
This paper characterizes the workload seen at the storage subsystem of an e-commerce system. Measurements are conducted on multi-tiered systems running three different benchmarks,...
Xi Zhang, Alma Riska, Erik Riedel