<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05264259</id>
  <dt>j</dt>
  <an>05264259</an>
  <augroup>
    <au>Bu, Tian-Ming</au>
    <au>Qi, Qi</au>
    <au>Sun, Aries Wei</au>
  </augroup>
  <ti>Unconditional competitive auctions with copy and budget constraints.</ti>
  <so>Theor. Comput. Sci. 393, No. 1-3, 1-13 (2008).</so>
  <py>2008</py>
  <pu>Elsevier Science Publishers, Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>unconditional competitive auction</ut>
    <ut>copy and budget constraints</ut>
    <ut>auctioneer-advantaged mechanism</ut>
    <ut>Nash equilibrium</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.tcs.2007.10.040</li>
  </ligroup>
  <abgroup>
    <ab>Summary: This paper investigates a new auction model in which bidders have both copy and budget constraints. This new model has extensive and interesting applications in auctions of online ad-words, software licenses, etc. We consider the following problem: Supposing all participators are rational, how does one allocate the objects and at what price so as to maximize the auctioneer's revenue. We introduce new kinds of mechanisms called auctioneer-advantaged mechanisms and present the notion of unconditional competitive auctions. A notably interesting property of auctioneer-advantaged mechanisms is that each bidder's self-interested strategy brings better utility not only to himself but also to the auctioneer. Then we present auctioneer-advantaged mechanisms for multi-unit auctions with copy and budget constraints. We prove that these auctions are unconditional competitive under the situation of both limited and unlimited supply.</ab>
    <rv></rv>
  </abgroup>
</item>