Learning algorithms for online principal-agent problems (and selling goods online)

@inproceedings{Conitzer2006LearningAF,
  title={Learning algorithms for online principal-agent problems (and selling goods online)},
  author={Vincent Conitzer and Nikesh Garera},
  booktitle={ICML},
  year={2006}
}
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This is complicated by the fact that the principal does not know the agent's utility function (or type). We study the online setting where at each round, the principal encounters a new agent, and the principal sets the rewards anew. At the end of each round, the principal only finds out the action that the agent took, but… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Online learni

  • A. ACM-EC . Blum, V. Kumar, A. Rudra, F. Wu
  • 2003
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…