Abstract

In this paper, we deal with situations arising from markets where an Internet search service provider offers a service of listing firms in decreasing order according to what they have bid. We call these ranking auction situations and introduce the corresponding TU-games. The core, as well as the two friendly solutions for the corners of the market, in this class of games can be easily described using a related assignment game. We study the Alexia value and the Shapley value of this type of games. Using these solutions, we show which circumstances in the game are in favor of the provider and which are beneficial to the bidders.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.