Sciweavers

44 search results - page 5 / 9
» An Efficient Approximate Algorithm for Winner Determination ...
Sort
View
FOCS
2008
IEEE
13 years 6 months ago
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
Deeparnab Chakrabarty, Gagan Goel
ATAL
2006
Springer
13 years 9 months ago
False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki
WIAS
2008
85views more  WIAS 2008»
13 years 5 months ago
Optimal combinatorial electricity markets
The deregulation of the electricity industry in many countries has created a number of marketplaces in which producers and consumers can operate in order to more effectively manage...
Yoseba K. Penya, Nicholas R. Jennings
ATAL
2009
Springer
14 years 10 days ago
A mixed multi-unit combinatorial auctions test suite
Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit c...
Andrea Giovannucci, Jesús Cerquides, Ulle E...
CP
2003
Springer
13 years 11 months ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
Alessio Guerri, Michela Milano