Delegated online search

DOI10.1016/j.artint.2024.104171MaRDI QIDQ6592990

Pirmin Braun, Martin Hoefer, Niklas Hahn, Conrad Schecker

Publication date: 26 August 2024

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

online algorithmsapproximation algorithmsprincipal-agent problemalgorithmic game theoryinformation designdelegated search

Mathematics Subject Classification ID

Economics of information (91B44) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Algorithmic game theory and complexity (91A68) Principal-agent models (91B43)

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial agency
• The secretary recommendation problem
• An Analysis of the Principal-Agent Problem
• Semiamarts and finite values
• Algorithmic Aspects of Private Bayesian Persuasion.
• Algorithmic Bayesian Persuasion
• Honest signaling in zero-sum games is hard, and lying is even harder
• The Complexity of Contracts
• On the Tractability of Public Persuasion with No Externalities
• A Model of Delegated Project Choice
• Optimal Delegation
• Algorithms for Persuasion with Limited Communication

This page was built for publication: Delegated online search