26 search results - page 5 / 6 » sigecom 2005 |
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
In a previously reported user study, we found that users were able to perform decision tradeoff tasks more efficiently and commit considerably fewer errors with the example critiq...
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
In this paper we consider a common form of the English auction that is widely used in online Internet auctions. This discrete bid auction requires that the bidders may only submit...