1 resultado para Randomized algorithms

em Repositório digital da Fundação Getúlio Vargas - FGV


Relevância:

60.00% 60.00%

Publicador:

Resumo:

This work focuses on obtaining truthful mechanisms that aim at maximizing both the revenue and the economic efficiency (social welfare) for the unitdemand combinatorial auction problem (UDCAP), in which a set of k items is auctioned to a set of n consumers. Although each consumer bids on all items, no consumer can purchase more than one item in the UDCAP. We present a framework for devising poly-time randomized competitive truthful mechanisms that can be used to either favor economic efficiency or revenue.