A tractable multiple agents protocol and algorithm for resource allocation under price rigidities
Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivi...
Ausführliche Beschreibung
Autor*in: |
Huang, Wei [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2015 |
---|
Schlagwörter: |
---|
Anmerkung: |
© Springer Science+Business Media New York 2015 |
---|
Übergeordnetes Werk: |
Enthalten in: Applied intelligence - Springer US, 1991, 43(2015), 3 vom: 05. Mai, Seite 564-577 |
---|---|
Übergeordnetes Werk: |
volume:43 ; year:2015 ; number:3 ; day:05 ; month:05 ; pages:564-577 |
Links: |
---|
DOI / URN: |
10.1007/s10489-015-0663-0 |
---|
Katalog-ID: |
OLC2066100595 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC2066100595 | ||
003 | DE-627 | ||
005 | 20230502204938.0 | ||
007 | tu | ||
008 | 200820s2015 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/s10489-015-0663-0 |2 doi | |
035 | |a (DE-627)OLC2066100595 | ||
035 | |a (DE-He213)s10489-015-0663-0-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
100 | 1 | |a Huang, Wei |e verfasserin |4 aut | |
245 | 1 | 0 | |a A tractable multiple agents protocol and algorithm for resource allocation under price rigidities |
264 | 1 | |c 2015 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
500 | |a © Springer Science+Business Media New York 2015 | ||
520 | |a Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits. | ||
650 | 4 | |a Resource allocation | |
650 | 4 | |a Price rigidity | |
650 | 4 | |a Multiple agents system | |
650 | 4 | |a Dynamic mechanism | |
650 | 4 | |a Constrained Walrasian equilibrium | |
700 | 1 | |a Liu, Hongbo |4 aut | |
700 | 1 | |a Dai, Guangyao |4 aut | |
700 | 1 | |a Abraham, Ajith |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Applied intelligence |d Springer US, 1991 |g 43(2015), 3 vom: 05. Mai, Seite 564-577 |w (DE-627)130990515 |w (DE-600)1080229-0 |w (DE-576)029154286 |x 0924-669X |7 nnns |
773 | 1 | 8 | |g volume:43 |g year:2015 |g number:3 |g day:05 |g month:05 |g pages:564-577 |
856 | 4 | 1 | |u https://doi.org/10.1007/s10489-015-0663-0 |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a GBV_ILN_70 | ||
951 | |a AR | ||
952 | |d 43 |j 2015 |e 3 |b 05 |c 05 |h 564-577 |
author_variant |
w h wh h l hl g d gd a a aa |
---|---|
matchkey_str |
article:0924669X:2015----::tatbeutpegnsrtclnagrtmorsucalct |
hierarchy_sort_str |
2015 |
publishDate |
2015 |
allfields |
10.1007/s10489-015-0663-0 doi (DE-627)OLC2066100595 (DE-He213)s10489-015-0663-0-p DE-627 ger DE-627 rakwb eng 004 VZ Huang, Wei verfasserin aut A tractable multiple agents protocol and algorithm for resource allocation under price rigidities 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits. Resource allocation Price rigidity Multiple agents system Dynamic mechanism Constrained Walrasian equilibrium Liu, Hongbo aut Dai, Guangyao aut Abraham, Ajith aut Enthalten in Applied intelligence Springer US, 1991 43(2015), 3 vom: 05. Mai, Seite 564-577 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:43 year:2015 number:3 day:05 month:05 pages:564-577 https://doi.org/10.1007/s10489-015-0663-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 43 2015 3 05 05 564-577 |
spelling |
10.1007/s10489-015-0663-0 doi (DE-627)OLC2066100595 (DE-He213)s10489-015-0663-0-p DE-627 ger DE-627 rakwb eng 004 VZ Huang, Wei verfasserin aut A tractable multiple agents protocol and algorithm for resource allocation under price rigidities 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits. Resource allocation Price rigidity Multiple agents system Dynamic mechanism Constrained Walrasian equilibrium Liu, Hongbo aut Dai, Guangyao aut Abraham, Ajith aut Enthalten in Applied intelligence Springer US, 1991 43(2015), 3 vom: 05. Mai, Seite 564-577 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:43 year:2015 number:3 day:05 month:05 pages:564-577 https://doi.org/10.1007/s10489-015-0663-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 43 2015 3 05 05 564-577 |
allfields_unstemmed |
10.1007/s10489-015-0663-0 doi (DE-627)OLC2066100595 (DE-He213)s10489-015-0663-0-p DE-627 ger DE-627 rakwb eng 004 VZ Huang, Wei verfasserin aut A tractable multiple agents protocol and algorithm for resource allocation under price rigidities 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits. Resource allocation Price rigidity Multiple agents system Dynamic mechanism Constrained Walrasian equilibrium Liu, Hongbo aut Dai, Guangyao aut Abraham, Ajith aut Enthalten in Applied intelligence Springer US, 1991 43(2015), 3 vom: 05. Mai, Seite 564-577 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:43 year:2015 number:3 day:05 month:05 pages:564-577 https://doi.org/10.1007/s10489-015-0663-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 43 2015 3 05 05 564-577 |
allfieldsGer |
10.1007/s10489-015-0663-0 doi (DE-627)OLC2066100595 (DE-He213)s10489-015-0663-0-p DE-627 ger DE-627 rakwb eng 004 VZ Huang, Wei verfasserin aut A tractable multiple agents protocol and algorithm for resource allocation under price rigidities 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits. Resource allocation Price rigidity Multiple agents system Dynamic mechanism Constrained Walrasian equilibrium Liu, Hongbo aut Dai, Guangyao aut Abraham, Ajith aut Enthalten in Applied intelligence Springer US, 1991 43(2015), 3 vom: 05. Mai, Seite 564-577 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:43 year:2015 number:3 day:05 month:05 pages:564-577 https://doi.org/10.1007/s10489-015-0663-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 43 2015 3 05 05 564-577 |
allfieldsSound |
10.1007/s10489-015-0663-0 doi (DE-627)OLC2066100595 (DE-He213)s10489-015-0663-0-p DE-627 ger DE-627 rakwb eng 004 VZ Huang, Wei verfasserin aut A tractable multiple agents protocol and algorithm for resource allocation under price rigidities 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits. Resource allocation Price rigidity Multiple agents system Dynamic mechanism Constrained Walrasian equilibrium Liu, Hongbo aut Dai, Guangyao aut Abraham, Ajith aut Enthalten in Applied intelligence Springer US, 1991 43(2015), 3 vom: 05. Mai, Seite 564-577 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:43 year:2015 number:3 day:05 month:05 pages:564-577 https://doi.org/10.1007/s10489-015-0663-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 43 2015 3 05 05 564-577 |
language |
English |
source |
Enthalten in Applied intelligence 43(2015), 3 vom: 05. Mai, Seite 564-577 volume:43 year:2015 number:3 day:05 month:05 pages:564-577 |
sourceStr |
Enthalten in Applied intelligence 43(2015), 3 vom: 05. Mai, Seite 564-577 volume:43 year:2015 number:3 day:05 month:05 pages:564-577 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Resource allocation Price rigidity Multiple agents system Dynamic mechanism Constrained Walrasian equilibrium |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Applied intelligence |
authorswithroles_txt_mv |
Huang, Wei @@aut@@ Liu, Hongbo @@aut@@ Dai, Guangyao @@aut@@ Abraham, Ajith @@aut@@ |
publishDateDaySort_date |
2015-05-05T00:00:00Z |
hierarchy_top_id |
130990515 |
dewey-sort |
14 |
id |
OLC2066100595 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2066100595</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502204938.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10489-015-0663-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066100595</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10489-015-0663-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Huang, Wei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A tractable multiple agents protocol and algorithm for resource allocation under price rigidities</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2015</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Resource allocation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Price rigidity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiple agents system</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic mechanism</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constrained Walrasian equilibrium</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Hongbo</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dai, Guangyao</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Abraham, Ajith</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Applied intelligence</subfield><subfield code="d">Springer US, 1991</subfield><subfield code="g">43(2015), 3 vom: 05. Mai, Seite 564-577</subfield><subfield code="w">(DE-627)130990515</subfield><subfield code="w">(DE-600)1080229-0</subfield><subfield code="w">(DE-576)029154286</subfield><subfield code="x">0924-669X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:43</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:3</subfield><subfield code="g">day:05</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:564-577</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10489-015-0663-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">43</subfield><subfield code="j">2015</subfield><subfield code="e">3</subfield><subfield code="b">05</subfield><subfield code="c">05</subfield><subfield code="h">564-577</subfield></datafield></record></collection>
|
author |
Huang, Wei |
spellingShingle |
Huang, Wei ddc 004 misc Resource allocation misc Price rigidity misc Multiple agents system misc Dynamic mechanism misc Constrained Walrasian equilibrium A tractable multiple agents protocol and algorithm for resource allocation under price rigidities |
authorStr |
Huang, Wei |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)130990515 |
format |
Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
0924-669X |
topic_title |
004 VZ A tractable multiple agents protocol and algorithm for resource allocation under price rigidities Resource allocation Price rigidity Multiple agents system Dynamic mechanism Constrained Walrasian equilibrium |
topic |
ddc 004 misc Resource allocation misc Price rigidity misc Multiple agents system misc Dynamic mechanism misc Constrained Walrasian equilibrium |
topic_unstemmed |
ddc 004 misc Resource allocation misc Price rigidity misc Multiple agents system misc Dynamic mechanism misc Constrained Walrasian equilibrium |
topic_browse |
ddc 004 misc Resource allocation misc Price rigidity misc Multiple agents system misc Dynamic mechanism misc Constrained Walrasian equilibrium |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Applied intelligence |
hierarchy_parent_id |
130990515 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Applied intelligence |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 |
title |
A tractable multiple agents protocol and algorithm for resource allocation under price rigidities |
ctrlnum |
(DE-627)OLC2066100595 (DE-He213)s10489-015-0663-0-p |
title_full |
A tractable multiple agents protocol and algorithm for resource allocation under price rigidities |
author_sort |
Huang, Wei |
journal |
Applied intelligence |
journalStr |
Applied intelligence |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2015 |
contenttype_str_mv |
txt |
container_start_page |
564 |
author_browse |
Huang, Wei Liu, Hongbo Dai, Guangyao Abraham, Ajith |
container_volume |
43 |
class |
004 VZ |
format_se |
Aufsätze |
author-letter |
Huang, Wei |
doi_str_mv |
10.1007/s10489-015-0663-0 |
dewey-full |
004 |
title_sort |
a tractable multiple agents protocol and algorithm for resource allocation under price rigidities |
title_auth |
A tractable multiple agents protocol and algorithm for resource allocation under price rigidities |
abstract |
Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits. © Springer Science+Business Media New York 2015 |
abstractGer |
Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits. © Springer Science+Business Media New York 2015 |
abstract_unstemmed |
Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits. © Springer Science+Business Media New York 2015 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 |
container_issue |
3 |
title_short |
A tractable multiple agents protocol and algorithm for resource allocation under price rigidities |
url |
https://doi.org/10.1007/s10489-015-0663-0 |
remote_bool |
false |
author2 |
Liu, Hongbo Dai, Guangyao Abraham, Ajith |
author2Str |
Liu, Hongbo Dai, Guangyao Abraham, Ajith |
ppnlink |
130990515 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s10489-015-0663-0 |
up_date |
2024-07-04T03:45:57.783Z |
_version_ |
1803618623465455616 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2066100595</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502204938.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10489-015-0663-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066100595</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10489-015-0663-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Huang, Wei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A tractable multiple agents protocol and algorithm for resource allocation under price rigidities</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2015</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In many resource allocation problems, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We investigate the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities. We propose a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items, and then introduce a dynamic mechanism with rationing to discover constrainedWalrasian equilibria under price rigidities in polynomial time. We also address the computation of buyers’ expected profits and items’ expected prices, and discuss strategical issues in the sense of expected profits.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Resource allocation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Price rigidity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiple agents system</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic mechanism</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constrained Walrasian equilibrium</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Hongbo</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dai, Guangyao</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Abraham, Ajith</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Applied intelligence</subfield><subfield code="d">Springer US, 1991</subfield><subfield code="g">43(2015), 3 vom: 05. Mai, Seite 564-577</subfield><subfield code="w">(DE-627)130990515</subfield><subfield code="w">(DE-600)1080229-0</subfield><subfield code="w">(DE-576)029154286</subfield><subfield code="x">0924-669X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:43</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:3</subfield><subfield code="g">day:05</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:564-577</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10489-015-0663-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">43</subfield><subfield code="j">2015</subfield><subfield code="e">3</subfield><subfield code="b">05</subfield><subfield code="c">05</subfield><subfield code="h">564-577</subfield></datafield></record></collection>
|
score |
7.4001713 |