Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Essays in Mechanism Design/ Aditya Vikram

By: Material type: TextTextPublication details: Kolkata: Indian Statistical Insttute, 2021Description: i,110pagsSubject(s): DDC classification:
  • 23 381 V694
Online resources:
Contents:
Introduction -- Stability and double auction design -- Budget-balanced mechanisms for single-object allocation problems with interdependent values -- Probability-burning mechanisms in multiple-good allocation problems -- References
Production credits:
  • Guided by Prof. Arunava Sen
Dissertation note: Thesis(Ph.D) - Indian Statistical Institute, 2021 Summary: The first chapter investigates the stability of internet platform trading mechanisms using the notion of ex-ante stability. Standard double auction mechanisms in the literature as well as the revenue-maximizing mechanism of the platform may not be single-buyer-single-seller (SBSS) ex-ante stable. We characterize interim incentive-compatible, interim individually-rational and symmetric revenue-maximizing mechanisms that are SBSS ex-ante stable using methods in Myerson and Satterthwaite (1983). The second chapter concerns the allocation of a single object among a set of agents whose valuations are interdependent. We define signal-ranking and valuation-ranking mechanisms. We show that if the s-ranking allocation rule satisfies a combinatorial condition and the valuation functions are additively separable, there exist budget-balanced and ex-post incentive-compatible s-ranking mechanisms. A similar result holds for v-ranking mechanisms if valuation functions also satisfy single-crossing condition. We discuss the efficiency properties of these mechanisms. We also define a third class of mechanisms called probability-burning mechanisms and study its welfare properties. In the third chapter, we study a multi-unit allocation problem where all agents have private valuations. We consider budget-balanced, dominant strategy incentive-compatible and individually-rational probability-burning mechanisms which allocate the units of good with non-zero probability only to the topmost agents. We propose one such mechanism with a reserve price and show that it is welfare-improving over probability-burning mechanism without reserve price given by Mishra and Sharma (2018).
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Notes Date due Barcode Item holds
THESIS ISI Library, Kolkata 381 V694 (Browse shelf(Opens below)) Available E- thesis. Guided by Prof. Prof. Arunava Sen TH544
Total holds: 0

Thesis(Ph.D) - Indian Statistical Institute, 2021

Includes bibliography

Introduction -- Stability and double auction design -- Budget-balanced mechanisms for single-object allocation problems with interdependent values -- Probability-burning mechanisms in multiple-good allocation problems -- References

Guided by Prof. Arunava Sen

The first chapter investigates the stability of internet platform trading mechanisms using the notion of ex-ante stability. Standard double auction mechanisms in the literature as well as the revenue-maximizing mechanism of the platform may not be single-buyer-single-seller (SBSS) ex-ante stable. We characterize interim incentive-compatible, interim individually-rational and symmetric revenue-maximizing mechanisms that are SBSS ex-ante stable using methods in Myerson and Satterthwaite (1983). The second chapter concerns the allocation of a single object among a set of agents whose valuations are interdependent. We define signal-ranking and valuation-ranking mechanisms. We show that if the s-ranking allocation rule satisfies a combinatorial condition and the valuation functions are additively separable, there exist budget-balanced and ex-post incentive-compatible s-ranking mechanisms. A similar result holds for v-ranking mechanisms if valuation functions also satisfy single-crossing condition. We discuss the efficiency properties of these mechanisms. We also define a third class of mechanisms called probability-burning mechanisms and study its welfare properties. In the third chapter, we study a multi-unit allocation problem where all agents have private valuations. We consider budget-balanced, dominant strategy incentive-compatible and individually-rational probability-burning mechanisms which allocate the units of good with non-zero probability only to the topmost agents. We propose one such mechanism with a reserve price and show that it is welfare-improving over probability-burning mechanism without reserve price given by Mishra and Sharma (2018).

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in