{"title":"资源型多商品市场计算","authors":"F. Ygge, H. Akkermans","doi":"10.1109/ICMAS.1998.699221","DOIUrl":null,"url":null,"abstract":"In search for general equilibrium in multi-commodity markets, price-oriented schemes are normally used. That is, a set of prices (one price for each commodity) is updated until supply meets demand for each commodity. In some cases such an approach is very inefficient and a resource-oriented scheme can be highly competitive. In a resource-oriented scheme the allocations are updated until the market equilibrium is found. It is well known that in a two-commodity market resource-oriented schemes are possible. We show that resource-oriented algorithms can be used for the general multi-commodity case as well, and present and analyze a specific algorithm. The algorithm has been implemented and some performance properties, for a specific example, are presented.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"On resource-oriented multi-commodity market computations\",\"authors\":\"F. Ygge, H. Akkermans\",\"doi\":\"10.1109/ICMAS.1998.699221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In search for general equilibrium in multi-commodity markets, price-oriented schemes are normally used. That is, a set of prices (one price for each commodity) is updated until supply meets demand for each commodity. In some cases such an approach is very inefficient and a resource-oriented scheme can be highly competitive. In a resource-oriented scheme the allocations are updated until the market equilibrium is found. It is well known that in a two-commodity market resource-oriented schemes are possible. We show that resource-oriented algorithms can be used for the general multi-commodity case as well, and present and analyze a specific algorithm. The algorithm has been implemented and some performance properties, for a specific example, are presented.\",\"PeriodicalId\":244857,\"journal\":{\"name\":\"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMAS.1998.699221\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMAS.1998.699221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On resource-oriented multi-commodity market computations
In search for general equilibrium in multi-commodity markets, price-oriented schemes are normally used. That is, a set of prices (one price for each commodity) is updated until supply meets demand for each commodity. In some cases such an approach is very inefficient and a resource-oriented scheme can be highly competitive. In a resource-oriented scheme the allocations are updated until the market equilibrium is found. It is well known that in a two-commodity market resource-oriented schemes are possible. We show that resource-oriented algorithms can be used for the general multi-commodity case as well, and present and analyze a specific algorithm. The algorithm has been implemented and some performance properties, for a specific example, are presented.