1034 search results - page 84 / 207 » Competitive generalized auctions |
111
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
152
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
STOC
2003
ACM
16 years 25 days ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
100
Voted
ALDT
2009
Springer
15 years 7 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
119
click to vote
WORDS
2005
IEEE
15 years 6 months ago
2005
IEEE
Web services (WS) provide a technology for integrating applications over the Internet. This paper proposes a multi-agent conceptual model of WS and an agent-oriented modelling and...