Truthful Mechanisms for One-Parameter Agents

By Moshe Babaioff. Encyclopedia of Algorithms, 2008

341 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/0eb72e18fa4f624629621eee5aa60ed7bdce45e8

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Sharrukh Zaman
2. Ariel D. Procaccia
3. Moshe Tennenholtz
4. Daniel Grosu

In Management Science and Operations Research

1. Sharrukh Zaman
2. Ariel D. Procaccia
3. Moshe Tennenholtz
4. Daniel Grosu
5. David F. Manlove
6. Andrew Critch

Citations in the corpus

• Combinatorial Auction-Based Allocation of Virtual Machine Instances in Clouds (2010, background): “But the running time of the CA-LP is prohibitively high because the payment calculation involves repeated solving of the linear program.”
• Approximate Mechanism Design without Money (2013, background): “The maximum cost of a y with respect to x is mc( y, x ) = max i ∈ N cost( y, x i ), whereas the maximum cost of P with respect to x is mc( P, x ) = E y ∼ P [mc( y, x )].”