Skip to main content

Budget-balanced and nearly efficient randomized mechanisms: Public goods and beyond

Publication ,  Journal Article
Guo, M; Naroditskiy, V; Conitzer, V; Greenwald, A; Jennings, NR
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
January 1, 2011

Many scenarios where participants hold private information require payments to encourage truthful revelation. Some of these scenarios have no natural residual claimant who would absorb the budget surplus or cover the deficit. Faltings [7] proposed the idea of excluding one agent uniformly at random and making him the residual claimant. Based on this idea, we propose two classes of public good mechanisms and derive optimal ones within each class: Faltings' mechanism is optimal in one of the classes. We then move on to general mechanism design settings, where we prove guarantees on the social welfare achieved by Faltings' mechanism. Finally, we analyze a modification of the mechanism where budget balance is achieved without designating any agent as the residual claimant. © 2011 Springer-Verlag Berlin Heidelberg.

Duke Scholars

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

January 1, 2011

Volume

7090 LNCS

Start / End Page

158 / 169

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Guo, M., Naroditskiy, V., Conitzer, V., Greenwald, A., & Jennings, N. R. (2011). Budget-balanced and nearly efficient randomized mechanisms: Public goods and beyond. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7090 LNCS, 158–169. https://doi.org/10.1007/978-3-642-25510-6_14
Guo, M., V. Naroditskiy, V. Conitzer, A. Greenwald, and N. R. Jennings. “Budget-balanced and nearly efficient randomized mechanisms: Public goods and beyond.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7090 LNCS (January 1, 2011): 158–69. https://doi.org/10.1007/978-3-642-25510-6_14.
Guo M, Naroditskiy V, Conitzer V, Greenwald A, Jennings NR. Budget-balanced and nearly efficient randomized mechanisms: Public goods and beyond. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2011 Jan 1;7090 LNCS:158–69.
Guo, M., et al. “Budget-balanced and nearly efficient randomized mechanisms: Public goods and beyond.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7090 LNCS, Jan. 2011, pp. 158–69. Scopus, doi:10.1007/978-3-642-25510-6_14.
Guo M, Naroditskiy V, Conitzer V, Greenwald A, Jennings NR. Budget-balanced and nearly efficient randomized mechanisms: Public goods and beyond. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2011 Jan 1;7090 LNCS:158–169.

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

January 1, 2011

Volume

7090 LNCS

Start / End Page

158 / 169

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences