89 search results - page 9 / 18 » Robust solutions for combinatorial auctions |
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
AIPS
2003
13 years 10 months ago
2003
We present economically augmented job shop scheduling (EJSP) as an example of a coordination problem among selfinterested agents with private information. We discuss its signific...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
IEEEARES
2010
IEEE
13 years 6 months ago
2010
IEEE
Online auctions of governmental bonds and CO2 certificates are challenged by high availability requirements in face of high peak loads around the auction deadline. Traditionally, t...