242 search results - page 10 / 49 » Auctions with Arbitrary Deals |
117
click to vote
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
NIPS
2007
14 years 11 months ago
2007
Incorporating invariances into a learning algorithm is a common problem in machine learning. We provide a convex formulation which can deal with arbitrary loss functions and arbit...
124
click to vote
STOC
2012
ACM
13 years 2 days ago
2012
ACM
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
CSE
2009
IEEE
15 years 29 days ago
2009
IEEE
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
104
click to vote
WINE
2010
Springer
14 years 7 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...