159 search results - page 20 / 32 » Computational Complexity of Fundamental Problems in Social C... |
SIGECOM
2003
ACM
15 years 5 months ago
2003
ACM
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
GD
2006
Springer
15 years 3 months ago
2006
Springer
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...
ATAL
2010
Springer
15 years 28 days ago
2010
Springer
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
115
click to vote
ATAL
2010
Springer
15 years 28 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
118
click to vote
PDC
2004
ACM
15 years 5 months ago
2004
ACM
Most experiments with participative design are with small scale, stand alone and not very strategic applications of ICT in organizations. However, modern ICT applications are incr...