Sciweavers

3433 search results - page 213 / 687
» Heuristics for a bidding problem
Sort
View
SASO
2008
IEEE
16 years 1 months ago
A Robust Audit Mechanism to Prevent Malicious Behaviors in Multi-robot Systems
Market-based mechanisms can be used to coordinate self-interested multi-robot systems in fully distributed environments, where by self-interested we mean that each robot agent att...
MyungJoo Ham, Gul A. Agha
INFOCOM
2006
IEEE
16 years 20 days ago
Using Repeated Games to Design Incentive-Based Routing Systems
Abstract— Incorporating pricing information in routing systems has been explored in various contexts and fashions. In this paper we examine certain fundamental properties importa...
Michael Afergan
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
16 years 7 days ago
Hot Item Mining and Summarization from Multiple Auction Web Sites
Online auction Web sites are fast changing, highly dynamic, and complex as they involve tremendous sellers and potential buyers, as well as a huge amount of items listed for biddi...
Tak-Lam Wong, Wai Lam
WECWIS
2005
IEEE
94views ECommerce» more  WECWIS 2005»
16 years 6 days ago
Truthful Online Auctions for Pricing Peer-to-Peer Services
We consider truthful online auctions that aim at optimizing sellers’ revenues, representing service contributors’ satisfactions, as a general model for pricing peer-to-peer se...
Po-An Chen, Tyng-Ruey Chuang
164
Voted
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
16 years 1 days ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen