75 search results - page 2 / 15 » Approximately Efficient Online Mechanism Design |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
JAVA
2000
Springer
13 years 8 months ago
2000
Springer
This paper describes a portable and efficient sampling-based online measurement system for production-level Java virtual machines. This system is designed to provide continuous re...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
This paper brings forward a two-phase semantic service discovery mechanism which supports both the operation matchmaking and operation-composition matchmaking. A serial of experim...
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we study a service procurement problem with uncertainty as to whether service providers are capable of completing a given task within a specified deadline. This typ...