Sciweavers

32 search results - page 3 / 7
» Computational Social Choice: Strategic and Combinatorial Asp...
Sort
View
COR
2010
96views more  COR 2010»
13 years 8 months ago
Strong activity rules for iterative combinatorial auctions
Activity rules have emerged in recent years as an important aspect of practical auction design. The role of an activity rule in an iterative auction is to suppress strategic behav...
Pavithra Harsha, Cynthia Barnhart, David C. Parkes...
SIGECOM
2011
ACM
216views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
Strategic sequential voting in multi-issue domains and multiple-election paradoxes
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
Lirong Xia, Vincent Conitzer, Jérôme ...
FOCS
2003
IEEE
14 years 1 months ago
Towards a Characterization of Truthful Combinatorial Auctions
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
Ron Lavi, Ahuva Mu'alem, Noam Nisan
IJAR
2007
104views more  IJAR 2007»
13 years 8 months ago
On representation and aggregation of social evaluations in computational trust and reputation models
Interest for computational trust and reputation models is on the rise. One of the most important aspects of these models is how they deal with information received from other indi...
Jordi Sabater-Mir, Mario Paolucci
ATAL
2010
Springer
13 years 9 months ago
Automated negotiation with decommitment for dynamic resource allocation in cloud computing
We consider the problem of allocating networked resources in dynamic environment, such as cloud computing platforms, where providers strategically price resources to maximize thei...
Bo An, Victor R. Lesser, David Irwin, Michael Zink