Sciweavers

1034 search results - page 42 / 207
» Competitive generalized auctions
Sort
View
WWW
2008
ACM
14 years 11 months ago
Gsp-exr: gsp protocol with an exclusive right for keyword auctions
We propose a keyword auction protocol called the Generalized Second Price with an Exclusive Right (GSP-ExR). In existing keyword auctions, the number of displayed advertisements i...
Yuko Sakurai, Atsushi Iwasaki, Yasumasa Saito, Mak...
DAC
2012
ACM
12 years 19 days ago
ComPLx: A Competitive Primal-dual Lagrange Optimization for Global Placement
We develop a projected-subgradient primal-dual Lagrange optimization for global placement, that can be instantiated with a variety of interconnect models. It decomposes the origin...
Myung-Chul Kim, Igor L. Markov
DAM
2008
85views more  DAM 2008»
13 years 10 months ago
The competition numbers of complete tripartite graphs
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
Suh-Ryung Kim, Yoshio Sano
IJCAI
2001
13 years 11 months ago
Bidding Languages for Combinatorial Auctions
Combinatorial auctions provide a valuable mechanism for the allocation of goods in settings where buyer valuations exhibit complex structure with respect to substitutabilityand co...
Craig Boutilier, Holger H. Hoos
SIGECOM
2000
ACM
127views ECommerce» more  SIGECOM 2000»
14 years 2 months ago
Towards a universal test suite for combinatorial auction algorithms
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
Kevin Leyton-Brown, Mark Pearson, Yoav Shoham