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

George Georgiadis

dblp:280/4561 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0002-5872-5747ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 since 2021Theory of computation · 3 · 3 since 2021

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
3 papers
Algorithmic game theory and mechanism design · 91% Mathematical optimization · 9%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design › contract theory
principal-agent problem
1.422024
Feedback Design in Dynamic Moral Hazard · EC 2024
Robust Contracts: A Revealed Preference Approach · EC 2023
Algorithmic game theory and mechanism design › mechanism design › information elicitation
feedback design
0.812024
Feedback Design in Dynamic Moral Hazard · EC 2024
Algorithmic game theory and mechanism design › mechanism design
contract design
0.712023
Robust Contracts: A Revealed Preference Approach · EC 2023
Algorithmic game theory and mechanism design › decision theory
revealed preference
0.712023
Robust Contracts: A Revealed Preference Approach · EC 2023
Algorithmic game theory and mechanism design › mechanism design
contest design
0.512021
Optimal Feedback in Contests · EC 2021
Algorithmic game theory and mechanism design › non-cooperative game › dynamic games
dynamic contest
0.512021
Optimal Feedback in Contests · EC 2021
Mathematical optimization › sequential decision making
feedback policy
0.512021
Optimal Feedback in Contests · EC 2021
Algorithmic game theory and mechanism design › resource allocation
prize allocation
0.512021
Optimal Feedback in Contests · EC 2021

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

dynamic mechanism design · 0.8contract theory · 0.8robust optimization · 0.7revealed preference · 0.7mechanism design · 0.5dynamic optimization · 0.5
YearPublicationVenuePosition
2024 Feedback Design in Dynamic Moral Hazard
abstract
The early stages of many careers serve as a trial period where employees seek a high-value reward (e.g., a promotion) while working hard to demonstrate their productivity. A key design component of such jobs is the performance feedback offered to the employee, as it allows them to adjust their behaviors and learn what their future rewards might look like. While some experts argue that a policy of full transparency is best---that is, keeping employees fully apprised of their performance---such practice is far form uniform as employers may see a strategic gain from hiding information or postponing its release.
Jeffrey Ely, George Georgiadis, Luis Rayo
EC2
2023 Robust Contracts: A Revealed Preference Approach
abstract
We study an agency model in which the principal has outcome data under different incentive schemes and aims to design an optimal contract under minimal assumptions about the way the agent responds to incentives. Events unfold as follows: (1) the principal offers a contract---a mapping from output to nonnegative payments; (2) the agent chooses costly action---a probability distribution over output; and (3) output and payoffs are realized. The principal has outcome data under K different contracts which, sidestepping estimation error, enables her to recover the action corresponding to each of these contracts. We assume that the agent best-responds to the offered contract and has quasi-linear preferences over money and actions, but we make no further assumptions about the production environment. The principal does not have prior beliefs about any of the unknown aspects of the environment. Instead, she seeks a contract that maximizes worst-case profit.
Nemanja Antic, George Georgiadis
EC2
2021 Optimal Feedback in Contests
abstract
We derive an optimal dynamic contest for environments where effort can be monitored only through a coarse, binary performance measure and the principal chooses prize-allocation and termination rules together with a real-time feedback policy for the contestants. The optimal contest takes a stark cyclical form: contestants are kept fully apprised of their own successes, and at the end of each fixed-length cycle, if at least one agent has succeeded, the contest ends and the prize is shared equally among all successful agents irrespective of when they succeeded; otherwise, the designer informs all contestants that nobody has yet succeeded and the contest resets. Applications include promotions, innovation contests, and proof-of-work protocols.
Jeffrey Ely, George Georgiadis, Sina Moghadas Khorasani, Luis Rayo
EC2