Combinatorial Auctions and Duality Theory

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F04274644%3A_____%2F18%3A%230000367" target="_blank" >RIV/04274644:_____/18:#0000367 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61384399:31140/18:00052172

Výsledek na webu

<a href="http://www.fhi.sk/files/katedry/kove/ssov/VKOXIX/Zbornik2018.pdf" target="_blank" >http://www.fhi.sk/files/katedry/kove/ssov/VKOXIX/Zbornik2018.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Combinatorial Auctions and Duality Theory

Popis výsledku v původním jazyce

Combinatorial auctions are those auctions in which bidders can place bids on combinations of items. Solving of combinatorial auctions can be modeled by linear programming problems with using of duality theory. The paper is devoted to analyzing an iterative approach to solving combinatorial auctions. In the iterative approach, there are multiple rounds of bidding and allocation and the problem is solved in an iterative and incremental way. There is a connection between efficient auctions and duality theory. The primal-dual algorithm can be taken as a decentralized and dynamic method of determine the pricing equilibrium. A primaldual algorithm usually maintains a feasible dual solution and tries to compute a primal solution that is both feasible and satisfies the complementary slackness conditions. If such a solution is found, the algorithm terminates. Otherwise the dual solution is updated towards optimality and the algorithm continues with the next iteration. Several auction formats based on the primal-dual approach have been proposed.

Název v anglickém jazyce

Combinatorial Auctions and Duality Theory

Popis výsledku anglicky

Combinatorial auctions are those auctions in which bidders can place bids on combinations of items. Solving of combinatorial auctions can be modeled by linear programming problems with using of duality theory. The paper is devoted to analyzing an iterative approach to solving combinatorial auctions. In the iterative approach, there are multiple rounds of bidding and allocation and the problem is solved in an iterative and incremental way. There is a connection between efficient auctions and duality theory. The primal-dual algorithm can be taken as a decentralized and dynamic method of determine the pricing equilibrium. A primaldual algorithm usually maintains a feasible dual solution and tries to compute a primal solution that is both feasible and satisfies the complementary slackness conditions. If such a solution is found, the algorithm terminates. Otherwise the dual solution is updated towards optimality and the algorithm continues with the next iteration. Several auction formats based on the primal-dual approach have been proposed.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

50204 - Business and management

Projekt

<a href="/cs/project/GBP402%2F12%2FG097" target="_blank" >GBP402/12/G097: DYME-Dynamické modely v ekonomii</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

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 statě ve sborníku

QUANTITATIVE METHODS IN ECONOMICS Multiple Criteria Decision Making XIX

ISBN

9788089962075

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

223-229

Název nakladatele

University of Economics, Bratislava

Místo vydání

Bratislava

Místo konání akce

Trenčianske Teplice, Slovakia

Datum konání akce

23. 5. 2018

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

000455265500029