2020
DOI: 10.1007/978-3-030-64946-3_15
|View full text |Cite
|
Sign up to set email alerts
|

On the Power and Limits of Dynamic Pricing in Combinatorial Markets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(15 citation statements)
references
References 7 publications
0
15
0
Order By: Relevance
“…It is worth noting that the existence of an optimal scheme reduces to the existence of an appropriate initial price vector; an optimal allocation then can be determined by induction. For a formal definition, we refer the reader to [2].…”
Section: :2 Market Pricing For Matroid Rank Valuationsmentioning
confidence: 99%
See 3 more Smart Citations
“…It is worth noting that the existence of an optimal scheme reduces to the existence of an appropriate initial price vector; an optimal allocation then can be determined by induction. For a formal definition, we refer the reader to [2].…”
Section: :2 Market Pricing For Matroid Rank Valuationsmentioning
confidence: 99%
“…Gul and Stacchetti [20] later verified that, in a sense, this condition is necessary to ensure the existence of a Walrasian equilibrium. 2 It was first observed by Cohen-Addad et al [8] and Hsu et al [21] that Walrasian prices are not sufficient to control the market, as ties must be broken in a coordinated fashion that is consistent with maximizing social welfare. A natural idea for resolving this issue would be trying to find Walrasian prices where ties do not occur.…”
Section: Previous Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Recently, Berger et al [2] considered markets beyond unit-demand valuations, and provided a polynomial-time algorithm for finding optimal dynamic prices up to three multi-demand buyers. Their approach is based on a generalization of the relation graph of [8] that they call a 'preference graph', and on a new directed graph termed the 'item-equivalence graph'.…”
Section: Introductionmentioning
confidence: 99%