<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Mechanism design</title>
    <subTitle>a linear programming approach</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Vohra, Rakesh V.</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">enk</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Cambridge</placeTerm>
    </place>
    <place>
      <placeTerm type="text">New York</placeTerm>
    </place>
    <publisher>Cambridge University Press</publisher>
    <dateIssued>2011</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>172 p. : ill.</extent>
  </physicalDescription>
  <abstract>"Mechanism design is an analytical framework for thinking clearly and carefully about what exactly a given institution can achieve when the information necessary to make decisions is dispersed and privately held. This analysis provides an account of the underlying mathematics of mechanism design based on linear programming. Three advantages characterize the approach. The first is simplicity: arguments based on linear programming are both elementary and transparent. The second is unity: the machinery of linear programming provides a way to unify results from disparate areas of mechanism design. The third is reach: the technique offers the ability to solve problems that appear to be beyond solutions offered by traditional methods. No claim is made that the approach advocated should supplant traditional mathematical machinery. Rather, the approach represents an addition to the tools of the economic theorist who proposes to understand economic phenomena through the lens of mechanism design"--</abstract>
  <tableOfContents>Machine generated contents note: 1. Introduction; 2. Arrow's theorem and its consequences; 3. Network flow problem; 4. Incentive compatibility; 5. Efficiency; 6. Revenue maximization; 7. Rationalizability.</tableOfContents>
  <tableOfContents>HKBU library</tableOfContents>
  <note type="statement of responsibility">Rakesh V. Vohra.</note>
  <note type="venue">YT2025 M08</note>
  <subject authority="lcsh">
    <topic>Decision making</topic>
    <topic>Linear programming</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Organizational behavior</topic>
    <topic>Mathematical models</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Machine theory</topic>
  </subject>
  <classification authority="lcc">HD30.23 V888 M 2011</classification>
  <relatedItem type="series">
    <titleInfo>
      <title>Econometric Society monographs ; 47</title>
    </titleInfo>
  </relatedItem>
  <identifier type="isbn">9781107004368</identifier>
  <identifier type="isbn">9780521179461</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">SDU</recordContentSource>
    <recordCreationDate encoding="marc">110228</recordCreationDate>
  </recordInfo>
</mods>
