Cover Image
QR Code

Almost budget-balanced VCG mechanisms to assign multiple objects.

Subsidy-free VCG mechanisms assign p identical objects to n agents. The efficiency loss is the largest ratio of budget surplus to efficient surplus, over all profiles of non-negative valuations. The smallest efficiency loss L[Graphic Character Omitted](n,p) satisfies L[Graphic Character Omitted](n,p...

Full description

Published in:Journal of Economic Theory Vol. 144; no. 1; pp. 96 - 120
Main Author: Moulin, Hervé
Format: Article
Published: Academic Press Inc. January 2009
Subjects:
Resource allocation > Mathematical models
Budget
Mathematical models
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ssf&AN=511436954&site=ehost-live
header:
  @attributes:
    shortDbName: ssf
    uiTerm: 511436954
    longDbName: Social Sciences Full Text (H.W. Wilson)
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00220531
        RTH
      jtl: Journal of Economic Theory
      issn: 00220531
      maglogo: N
    pubinfo:
      dt: January 2009
      vid: 144
      iid: 1
      pid: 735
      pub: Academic Press Inc.
    artinfo:
      ui:
        511436954
        10.1016/j.jet.2008.03.003
      ppf: 96
      ppct: 24
      formats:
      tig:
        atl: Almost budget-balanced VCG mechanisms to assign multiple objects.
      aug:
        au: Moulin, Hervé
      su:
        Resource allocation -- Mathematical models
        Budget
        Mathematical models
      sug:
        subj:
          Resource allocation -- Mathematical models
          Budget
          Mathematical models
      ab: Subsidy-free VCG mechanisms assign p identical objects to n agents. The efficiency loss is the largest ratio of budget surplus to efficient surplus, over all profiles of non-negative valuations. The smallest efficiency loss L[Graphic Character Omitted](n,p) satisfies L[Graphic Character Omitted](n,p)≤L[Graphic Character Omitted](n,[Graphic Character Omitted]n2[Graphic Character Omitted])≤43n. If pn is bounded away from 12, L[Graphic Character Omitted](n,p) converges to zero exponentially in n. Participation is voluntary in the optimal mechanism achieving L[Graphic Character Omitted](n,p) if p=1, but not if p≥2. Among voluntary mechanisms, the optimal efficiency loss is not significantly larger than L[Graphic Character Omitted](n,p) if pn≤12. But it does not converge to zero in n if pn>12. Copyright (c) 2008 Elsevier Inc.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: N
    holdings:
      @attributes:
        islocal: N