Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Georg Ziegler

dblp:45/8177 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design
auction design
0.112010
Efficiency with linear prices: a theoretical and experimental analysis of the combinatorial clock auction · EC 2010
Algorithmic game theory and mechanism design › auction theory
combinatorial auction
0.112010
Efficiency with linear prices: a theoretical and experimental analysis of the combinatorial clock auction · EC 2010
Algorithmic game theory and mechanism design › auction theory › combinatorial auction
combinatorial clock auction
0.112010
Efficiency with linear prices: a theoretical and experimental analysis of the combinatorial clock auction · EC 2010

Methods — techniques the papers use, named apart from their topics

experimental analysis · 0.1
YearPublicationVenuePosition
2010 Efficiency with linear prices: a theoretical and experimental analysis of the combinatorial clock auction
abstract
Combinatorial auctions have been suggested as a mean to raise efficiency in multi-item negotiations with complementarities as they can be found in procurement, in energy markets, in transportation, and for the sale of spectrum auctions. Anonymous linear ask prices are desirable and sometimes even essential for many of these applications. The Combinatorial Clock (CC) auction [4] has become very popular in these markets for its simplicity and as it "produces highly usable price discovery, because of the item prices (linear pricing)" [1]. Unfortunately, the CC auction fails to lead always to efficient outcomes, and there is no theory on equilibrium bidding strategies in such auctions. Given the importance of the CC auction in the field, it is desirable to better understand this auction format.
Martin Bichler, Pasha Shabalin, Georg Ziegler
EC3