Algorithms for Equilibrium Prices in Linear Market Models View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2014

AUTHORS

Kurt Mehlhorn

ABSTRACT

Near the end of the 19th century, Leon Walrus [Wal74] and Irving Fisher [Fis91] introduced general market models and asked for the existence of equilibrium prices. Chapters 5 and 6 of [NRTV07] are an excellent introduction into the algorithmic theory of market models. In Walrus’ model, each person comes to the market with a set of goods and a utility function for bundles of goods. At a set of prices, a person will only buy goods that give him maximal satisfaction.1 The question is to find a set of prices at which the market clears, i.e., all goods are sold and all money is spent. Observe that the money available to an agent is exactly the money earned by selling his goods. Fisher’s model is somewhat simpler. In Fisher’s model every agent comes with a predetermined amount of money. Market clearing prices are also called equilibrium prices. Walrus and Fisher took it for granted that equilibrium prices exist. Fisher designed a hydromechanical computing machine that would compute the prices in a market with three buyers, three goods, and linear utilities [BS00]. More... »

PAGES

1-4

Book

TITLE

Algorithms and Computation

ISBN

978-3-319-04656-3
978-3-319-04657-0

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-04657-0_1

DOI

http://dx.doi.org/10.1007/978-3-319-04657-0_1

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1027596556


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/14", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Economics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1402", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Applied Economics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany", 
          "id": "http://www.grid.ac/institutes/grid.419528.3", 
          "name": [
            "Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mehlhorn", 
        "givenName": "Kurt", 
        "id": "sg:person.011757371347.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011757371347.43"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2014", 
    "datePublishedReg": "2014-01-01", 
    "description": "Near the end of the 19th century, Leon Walrus [Wal74] and Irving Fisher [Fis91] introduced general market models and asked for the existence of equilibrium prices. Chapters 5 and 6 of [NRTV07] are an excellent introduction into the algorithmic theory of market models. In Walrus\u2019 model, each person comes to the market with a set of goods and a utility function for bundles of goods. At a set of prices, a person will only buy goods that give him maximal satisfaction.1 The question is to find a set of prices at which the market clears, i.e., all goods are sold and all money is spent. Observe that the money available to an agent is exactly the money earned by selling his goods. Fisher\u2019s model is somewhat simpler. In Fisher\u2019s model every agent comes with a predetermined amount of money. Market clearing prices are also called equilibrium prices. Walrus and Fisher took it for granted that equilibrium prices exist. Fisher designed a hydromechanical computing machine that would compute the prices in a market with three buyers, three goods, and linear utilities [BS00].", 
    "editor": [
      {
        "familyName": "Pal", 
        "givenName": "Sudebkumar Prasant", 
        "type": "Person"
      }, 
      {
        "familyName": "Sadakane", 
        "givenName": "Kunihiko", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-04657-0_1", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-04656-3", 
        "978-3-319-04657-0"
      ], 
      "name": "Algorithms and Computation", 
      "type": "Book"
    }, 
    "keywords": [
      "set of prices", 
      "equilibrium prices", 
      "market model", 
      "general market model", 
      "Linear Market Model", 
      "market clearing price", 
      "bundle of goods", 
      "set of goods", 
      "amount of money", 
      "clearing price", 
      "Irving Fisher", 
      "linear utility", 
      "prices", 
      "utility function", 
      "goods", 
      "Fisher model", 
      "market", 
      "money", 
      "algorithmic theory", 
      "maximal satisfaction", 
      "computing machines", 
      "buyers", 
      "Chapter 5", 
      "excellent introduction", 
      "fishers", 
      "model", 
      "set", 
      "theory", 
      "algorithm", 
      "existence", 
      "utility", 
      "questions", 
      "introduction", 
      "century", 
      "function", 
      "machine", 
      "bundles", 
      "persons", 
      "agents", 
      "satisfaction", 
      "end", 
      "amount", 
      "walruses"
    ], 
    "name": "Algorithms for Equilibrium Prices in Linear Market Models", 
    "pagination": "1-4", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1027596556"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-04657-0_1"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-04657-0_1", 
      "https://app.dimensions.ai/details/publication/pub.1027596556"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-09-02T16:10", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220902/entities/gbq_results/chapter/chapter_115.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-04657-0_1"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-04657-0_1'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-04657-0_1'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-04657-0_1'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-04657-0_1'


 

This table displays all metadata directly associated to this object as RDF triples.

107 TRIPLES      22 PREDICATES      68 URIs      61 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-04657-0_1 schema:about anzsrc-for:14
2 anzsrc-for:1402
3 schema:author Nffc660c8a6df48689e20f5f8266b4790
4 schema:datePublished 2014
5 schema:datePublishedReg 2014-01-01
6 schema:description Near the end of the 19th century, Leon Walrus [Wal74] and Irving Fisher [Fis91] introduced general market models and asked for the existence of equilibrium prices. Chapters 5 and 6 of [NRTV07] are an excellent introduction into the algorithmic theory of market models. In Walrus’ model, each person comes to the market with a set of goods and a utility function for bundles of goods. At a set of prices, a person will only buy goods that give him maximal satisfaction.1 The question is to find a set of prices at which the market clears, i.e., all goods are sold and all money is spent. Observe that the money available to an agent is exactly the money earned by selling his goods. Fisher’s model is somewhat simpler. In Fisher’s model every agent comes with a predetermined amount of money. Market clearing prices are also called equilibrium prices. Walrus and Fisher took it for granted that equilibrium prices exist. Fisher designed a hydromechanical computing machine that would compute the prices in a market with three buyers, three goods, and linear utilities [BS00].
7 schema:editor Na6cafac611a749c18b4aef9321e3d335
8 schema:genre chapter
9 schema:isAccessibleForFree false
10 schema:isPartOf Nbab3bcdf987b4325b6daa578ffae75f8
11 schema:keywords Chapter 5
12 Fisher model
13 Irving Fisher
14 Linear Market Model
15 agents
16 algorithm
17 algorithmic theory
18 amount
19 amount of money
20 bundle of goods
21 bundles
22 buyers
23 century
24 clearing price
25 computing machines
26 end
27 equilibrium prices
28 excellent introduction
29 existence
30 fishers
31 function
32 general market model
33 goods
34 introduction
35 linear utility
36 machine
37 market
38 market clearing price
39 market model
40 maximal satisfaction
41 model
42 money
43 persons
44 prices
45 questions
46 satisfaction
47 set
48 set of goods
49 set of prices
50 theory
51 utility
52 utility function
53 walruses
54 schema:name Algorithms for Equilibrium Prices in Linear Market Models
55 schema:pagination 1-4
56 schema:productId N141e8b0499d14bf5b93601c0b85870c9
57 Ncd440238fc0f4f858802fd89360ac118
58 schema:publisher N8f2e1b52196c4c1f8e20aff015b514d7
59 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027596556
60 https://doi.org/10.1007/978-3-319-04657-0_1
61 schema:sdDatePublished 2022-09-02T16:10
62 schema:sdLicense https://scigraph.springernature.com/explorer/license/
63 schema:sdPublisher N4441f0499ffd4c9e9fc90b928f65f0bd
64 schema:url https://doi.org/10.1007/978-3-319-04657-0_1
65 sgo:license sg:explorer/license/
66 sgo:sdDataset chapters
67 rdf:type schema:Chapter
68 N141e8b0499d14bf5b93601c0b85870c9 schema:name dimensions_id
69 schema:value pub.1027596556
70 rdf:type schema:PropertyValue
71 N4441f0499ffd4c9e9fc90b928f65f0bd schema:name Springer Nature - SN SciGraph project
72 rdf:type schema:Organization
73 N8f2e1b52196c4c1f8e20aff015b514d7 schema:name Springer Nature
74 rdf:type schema:Organisation
75 N90e3c7a95a9c4164b2e551a99fd47e03 rdf:first Nacc7433ef4154b359cef16da0ae88b07
76 rdf:rest rdf:nil
77 Na6cafac611a749c18b4aef9321e3d335 rdf:first Nb07da6287a7848358791a5d8f8a44913
78 rdf:rest N90e3c7a95a9c4164b2e551a99fd47e03
79 Nacc7433ef4154b359cef16da0ae88b07 schema:familyName Sadakane
80 schema:givenName Kunihiko
81 rdf:type schema:Person
82 Nb07da6287a7848358791a5d8f8a44913 schema:familyName Pal
83 schema:givenName Sudebkumar Prasant
84 rdf:type schema:Person
85 Nbab3bcdf987b4325b6daa578ffae75f8 schema:isbn 978-3-319-04656-3
86 978-3-319-04657-0
87 schema:name Algorithms and Computation
88 rdf:type schema:Book
89 Ncd440238fc0f4f858802fd89360ac118 schema:name doi
90 schema:value 10.1007/978-3-319-04657-0_1
91 rdf:type schema:PropertyValue
92 Nffc660c8a6df48689e20f5f8266b4790 rdf:first sg:person.011757371347.43
93 rdf:rest rdf:nil
94 anzsrc-for:14 schema:inDefinedTermSet anzsrc-for:
95 schema:name Economics
96 rdf:type schema:DefinedTerm
97 anzsrc-for:1402 schema:inDefinedTermSet anzsrc-for:
98 schema:name Applied Economics
99 rdf:type schema:DefinedTerm
100 sg:person.011757371347.43 schema:affiliation grid-institutes:grid.419528.3
101 schema:familyName Mehlhorn
102 schema:givenName Kurt
103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011757371347.43
104 rdf:type schema:Person
105 grid-institutes:grid.419528.3 schema:alternateName Max-Planck-Institut für Informatik, Saarbrücken, Germany
106 schema:name Max-Planck-Institut für Informatik, Saarbrücken, Germany
107 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...