Sciweavers

14 search results - page 1 / 3
» Mechanism Design for Set Cover Games When Elements Are Agent...
Sort
View
AAIM
2005
Springer
75views Algorithms» more  AAIM 2005»
13 years 10 months ago
Mechanism Design for Set Cover Games When Elements Are Agents
In this paper we study the set cover games when the elements are selfish agents. In this case, each element has a privately known valuation of receiving the service from the sets,...
Zheng Sun, Xiang-Yang Li, Weizhao Wang, Xiaowen Ch...
STACS
2005
Springer
13 years 10 months ago
Cost Sharing and Strategyproof Mechanisms for Set Cover Games
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...
Xiang-Yang Li, Zheng Sun, Weizhao Wang
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
13 years 10 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
MST
2010
196views more  MST 2010»
12 years 11 months ago
Non-Cooperative Cost Sharing Games via Subsidies
We consider a cost sharing system where users are selfish and act according to their own interest. There is a set of facilities and each facility provides services to a subset of ...
Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ar...
UAI
2004
13 years 6 months ago
Regret Minimizing Equilibria and Mechanisms for Games with Strict Type Uncertainty
Mechanism design has found considerable application to the construction of agent-interaction protocols. In the standard setting, the type (e.g., utility function) of an agent is n...
Nathanael Hyafil, Craig Boutilier