Sciweavers

577 search results - page 6 / 116
» Budget Feasible Mechanisms
Sort
View
WINE
2005
Springer
118views Economy» more  WINE 2005»
15 years 3 months ago
Nash Equilibria and Dominant Strategies in Routing
Nash equilibria and dominant strategies are two of the major approaches to deal with selfishness in an automated system (AS), where each agent is a selfish entity. In this paper,...
Weizhao Wang, Xiang-Yang Li, Xiaowen Chu
MSWIM
2004
ACM
15 years 2 months ago
Energy map construction for wireless sensor network under a finite energy budget
A fundamental issue in the design of a wireless sensor network is to devise mechanisms to make efficient use of its energy, and thus, extend its lifetime. Due to the paramount imp...
Raquel A. F. Mini, Antonio Alfredo Ferreira Lourei...
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 2 months 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
65
Voted
CONCURRENCY
2008
84views more  CONCURRENCY 2008»
14 years 9 months ago
Exploring the feasibility of proactive reputations
Reputation mechanisms help peers in a peer-to-peer (P2P) system avoid unreliable or malicious peers. In application-level networks, however, short peer life-times mean reputations...
Gayatri Swamynathan, Ben Y. Zhao, Kevin C. Almerot...
65
Voted
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 4 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh