<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-23T08:49:34Z</responseDate>
  <request identifier="1152" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1152</identifier>
        <datestamp>2024-03-06T11:07:35Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>An Axiomatic Approach to Personalized Ranking Systems</dc:title>
          <dc:creator>Altman, Alon</dc:creator>
          <dc:creator>Tennenholtz, Moshe</dc:creator>
          <dc:subject>Ranking systems</dc:subject>
          <dc:subject>trust</dc:subject>
          <dc:subject>axiomatization</dc:subject>
          <dc:subject>incentives</dc:subject>
          <dc:subject>mechanism design</dc:subject>
          <dc:subject>game theory</dc:subject>
          <dc:description>Personalized ranking systems and trust systems are an &#13;
essential tool for collaboration in a multi-agent &#13;
environment. In these systems, trust relations between &#13;
many agents are aggregated to produce a personalized &#13;
trust rating of the agents. In this paper we introduce &#13;
the first extensive axiomatic study of this setting, &#13;
and explore a wide array of well-known and new &#13;
personalized ranking systems. We adapt several axioms &#13;
(basic criteria) from the literature on global ranking &#13;
systems to the context of personalized ranking systems, &#13;
and fully classify the set of systems that satisfy all &#13;
of these axioms. We further show that all these axioms &#13;
are necessary for this result.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Alon Altman and Moshe Tennenholtz</dc:contributor>
          <dc:date>2007</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.07271.3</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-11527</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.3</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
