41 search results - page 7 / 9 » On the Price of Truthfulness in Path Auctions |
AMEC
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In a combinatorial auction, there are multiple items for sale, and bidders are allowed to place a bid on a bundle of these items rather than just on the individual items....
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— In autonomous mobile ad hoc networks (MANET) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or, ho...
SIGECOM
2010
ACM
14 years 2 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
ACMICEC
2003
ACM
14 years 3 months ago
2003
ACM
We develop two algorithms to manage bid data in flexible, multi-unit double auctions. The first algorithm is a multi-unit extension of the 4-HEAP algorithm, and the second is a ...