2019
DOI: 10.1007/978-3-030-35389-6_20
|View full text |Cite
|
Sign up to set email alerts
|

On Core-Selecting and Core-Competitive Mechanisms for Binary Single-Parameter Auctions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…The non-decreasing property has been observed for the VN payment rule in LLG auctions [2], but does not hold in other single-minded CAs [5]. Markakis and Tsikirdis examined two other payment rules, 0-nearest and b-nearest, which select the closest point in the minimum-revenue core to the origin and to the actual bids, respectively [14]. They prove that these two payment rules satisfy the non-decreasing property in single-minded CAs.…”
Section: Related Workmentioning
confidence: 99%
“…The non-decreasing property has been observed for the VN payment rule in LLG auctions [2], but does not hold in other single-minded CAs [5]. Markakis and Tsikirdis examined two other payment rules, 0-nearest and b-nearest, which select the closest point in the minimum-revenue core to the origin and to the actual bids, respectively [14]. They prove that these two payment rules satisfy the non-decreasing property in single-minded CAs.…”
Section: Related Workmentioning
confidence: 99%