A tractable multiple agents protocol and algorithm for resource allocation under price rigidities

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86099388" target="_blank" >RIV/61989100:27240/15:86099388 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s10489-015-0663-0" target="_blank" >http://dx.doi.org/10.1007/s10489-015-0663-0</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10489-015-0663-0" target="_blank" >10.1007/s10489-015-0663-0</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A tractable multiple agents protocol and algorithm for resource allocation under price rigidities

Popis výsledku v původním jazyce

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. (C) 2015, Springer Science+Business Media New York

Název v anglickém jazyce

A tractable multiple agents protocol and algorithm for resource allocation under price rigidities

Popis výsledku anglicky

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. (C) 2015, Springer Science+Business Media New York

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Applied Intelligence

ISSN

0924-669X

e-ISSN

—

Svazek periodika

3

Číslo periodika v rámci svazku

43

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

14

Strana od-do

564-577

Kód UT WoS článku

000361391200007

EID výsledku v databázi Scopus

2-s2.0-84941877523