Mechanism design via differential privacy

F McSherry, K Talwar - 48th Annual IEEE Symposium on …, 2007 - ieeexplore.ieee.org
We study the role that privacy-preserving algorithms, which prevent the leakage of specific
information about participants, can play in the design of mechanisms for strategic agents …

A framework for truthful online auctions in cloud computing with heterogeneous user demands

H Zhang, H Jiang, B Li, F Liu… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Auction-style pricing policies can effectively reflect the underlying trends in demand and
supply for the cloud resources, and thereby attracted a research interest recently. In …

DTD: An intelligent data and bid dual truth discovery scheme for MCS in IIoT

Y Kang, A Liu, NN Xiong, S Zhang… - IEEE Internet of …, 2023 - ieeexplore.ieee.org
Mobile crowdsensing (MCS) is a crucial component in the Industrial Internet of Things (IIoT),
mainly due to its role in collecting data and enhancing applications. Nonetheless, it faces …

Matroids, secretary problems, and online mechanisms

M Babaioff, N Immorlica, R Kleinberg - Symposium on Discrete …, 2007 - microsoft.com
We study a generalization of the classical secretary problem which we call the “matroid
secretary problem”. In this problem, the elements of a matroid are presented to an online …

[PDF][PDF] Automated online mechanism design and prophet inequalities

MT Hajiaghayi, R Kleinberg, T Sandholm - AAAI, 2007 - cdn.aaai.org
Recent work on online auctions for digital goods has explored the role of optimal stopping
theory—particularly secretary problems—in the design of approximately optimal online …

Characterizing truthful multi-armed bandit mechanisms

M Babaioff, Y Sharma, A Slivkins - … of the 10th ACM conference on …, 2009 - dl.acm.org
We consider a multi-round auction setting motivated by pay-per-click auctions for Internet
advertising. In each round the auctioneer selects an advertiser and shows her ad, which is …

Online mechanisms

DC Parkes - 2007 - dash.harvard.edu
Online mechanisms extend the methods of mechanism design to dynamic environments
with multiple agents and private information. Decisions must be made as information about …

Online auctions with re-usable goods

MT Hajiaghayi - Proceedings of the 6th ACM conference on Electronic …, 2005 - dl.acm.org
This paper concerns the design of mechanisms for online scheduling in which agents bid for
access to a re-usable resource such as processor time or wireless network access. Each …

A multi-agent and auction-based framework and approach for carrier collaboration

B Dai, H Chen - Logistics Research, 2011 - Springer
Carrier collaboration in transportation means multiple carriers form an alliance to optimize
their transportation operations through sharing transportation requests and vehicle …

Approximate strategyproofness

B Lubin, DC Parkes - Current Science, 2012 - JSTOR
The standard approach of mechanism design theory insists on equilibrium behaviour by
participants. This assumption is captured by imposing incentive constraints on the design …