Optimal Impartial Correspondences
We study mechanisms that select a subset of the vertex set of a directed graph in order to maximize the minimum indegree of any selected vertex, subject to an impartiality constraint that the selection of a particular vertex is independent of the outgoing edges of that vertex. For graphs with maximu...
Uložené v:
| Vydané v: | arXiv.org |
|---|---|
| Hlavní autori: | , , |
| Médium: | Paper |
| Jazyk: | English |
| Vydavateľské údaje: |
Ithaca
Cornell University Library, arXiv.org
11.01.2023
|
| Predmet: | |
| ISSN: | 2331-8422 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We study mechanisms that select a subset of the vertex set of a directed graph in order to maximize the minimum indegree of any selected vertex, subject to an impartiality constraint that the selection of a particular vertex is independent of the outgoing edges of that vertex. For graphs with maximum outdegree \(d\), we give a mechanism that selects at most \(d+1\) vertices and only selects vertices whose indegree is at least the maximum indegree in the graph minus one. We then show that this is best possible in the sense that no impartial mechanism can only select vertices with maximum degree, even without any restriction on the number of selected vertices. We finally obtain the following trade-off between the maximum number of vertices selected and the minimum indegree of any selected vertex: when selecting at most~\(k\) vertices out of \(n\), it is possible to only select vertices whose indegree is at least the maximum indegree minus \(\lfloor(n-2)/(k-1)\rfloor+1\). |
|---|---|
| AbstractList | We study mechanisms that select a subset of the vertex set of a directed graph in order to maximize the minimum indegree of any selected vertex, subject to an impartiality constraint that the selection of a particular vertex is independent of the outgoing edges of that vertex. For graphs with maximum outdegree \(d\), we give a mechanism that selects at most \(d+1\) vertices and only selects vertices whose indegree is at least the maximum indegree in the graph minus one. We then show that this is best possible in the sense that no impartial mechanism can only select vertices with maximum degree, even without any restriction on the number of selected vertices. We finally obtain the following trade-off between the maximum number of vertices selected and the minimum indegree of any selected vertex: when selecting at most~\(k\) vertices out of \(n\), it is possible to only select vertices whose indegree is at least the maximum indegree minus \(\lfloor(n-2)/(k-1)\rfloor+1\). |
| Author | Cembrano, Javier Klimm, Max Fischer, Felix |
| Author_xml | – sequence: 1 givenname: Javier surname: Cembrano fullname: Cembrano, Javier – sequence: 2 givenname: Felix surname: Fischer fullname: Fischer, Felix – sequence: 3 givenname: Max surname: Klimm fullname: Klimm, Max |
| BookMark | eNotjc1KAzEURoMoWGsfwJ3iesbk3iR3spTBn0Khm-5LmrmBKe1kTKbi4zugm_Od1XfuxPWQBhbiQclaN8bIF59_-u8aUKpaaqP1lVgAoqoaDXArVqUcpZRgCYzBhXjajlN_9qfH9Xn0eepna1POXMY0dDwELvfiJvpT4dX_LsXu_W3Xflab7ce6fd1U3gBVAaOXB2fcTMWdsnFWOHiwOhBjUD5Gh9YSR2M1k-vIhqhU9ORQxwaX4vnvdszp68Jl2h_TJQ9zcQ9kNTXSEOEvW8NByA |
| ContentType | Paper |
| Copyright | 2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.2301.04544 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central Technology Collection ProQuest One Community College ProQuest Central SciTech Premium Collection ProQuest Engineering Collection Engineering Database (subscription) ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a527-c3fa0b959a0b1ed16f59a2ba264c7e3c1aff93667ef564e79d76cf11fa7934f83 |
| IEDL.DBID | BENPR |
| IngestDate | Mon Jun 30 09:20:37 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a527-c3fa0b959a0b1ed16f59a2ba264c7e3c1aff93667ef564e79d76cf11fa7934f83 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2764780577?pq-origsite=%requestingapplication% |
| PQID | 2764780577 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2764780577 |
| PublicationCentury | 2000 |
| PublicationDate | 20230111 |
| PublicationDateYYYYMMDD | 2023-01-11 |
| PublicationDate_xml | – month: 01 year: 2023 text: 20230111 day: 11 |
| PublicationDecade | 2020 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2023 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.8188242 |
| SecondaryResourceType | preprint |
| Snippet | We study mechanisms that select a subset of the vertex set of a directed graph in order to maximize the minimum indegree of any selected vertex, subject to an... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Apexes Graph theory Vertex sets |
| Title | Optimal Impartial Correspondences |
| URI | https://www.proquest.com/docview/2764780577 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BCytv8ShVkVhNY8exkwmJqhUdKBF0KFN1cWypUklLUip-PrZJYUBiYbFseTnLvofPn-8DuI55qO2tAokwKAhHqUjCDCVaMxVjEKCV3pNNyNEonkyStE64VTWscmMTvaHOF8rlyLtMul-RNrqQt8s34lij3OtqTaGxDU1XqYw3oHnXH6VP31kWJqSNmcOv50xfvKuL5cds7fDP9MaVn-O_jLD3LIO9_8q0D80Ul7o8gC1dHMKuR3Sq6giuHq0xeMV5Z-hA5laP552eZ-JYLgrPI1odw3jQH_fuSc2HQDBikqjQYJAlUWJbqnMqjO2yDG1Io6QOFUVjklAIqU0kuJZJLoUylBq0OshNHJ5Ao1gU-hQ6Rpss1MY6qiDjLBNxHiGVcc58eULJz6C1WfC0PtPV9Ge1539PX7jLL3WIVkJpCxqr8l1fwo5ar2ZV2a63qO1Qls92lA4f0pdP11ye4g |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3PT8IwFH5R0OjJ3_EH6kz0WFm7rd0OxgNKICCSyIHb0nVtQoIDGaL-Uf6PtoXpwcQbBy_NkiZL8_r69fX16_sALkPfk_pUwRFVnCKfM4EiojCSkoiQuy7Xo7diE6zTCfv9qLsCn8VbGEOrLDDRAnU6EiZHXiXMvIrU0QW7Hb8goxplblcLCY25W7Tkx5s-suU3zTs9v1eE1O97tQZaqAogHhCGhKe4m0RBpFssU0yV_iQJ14GBYNITmCsVeZQyqQLqSxaljAqFseLak30Vevq3q1D2DfhbpuDTd0qHUKYDdG9-d2orhVX55H0wM2RrfG1q3fm_EN9uY_Wtf2aAbSh3-VhOdmBFZruwbtmqIt-Di0cNdM986DQNgV5j1NCpWZWR8SizGqn5PvSWMagDKGWjTB6Co6RKPKn0JuwmPklomAYcszAltvQi84-gUtg3XqzXPP4x7vHf3eew0eg9tON2s9M6gU0jPm8SMhhXoDSdvMpTWBOz6SCfnFnfcCBe8lR8AV5D-BQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimal+Impartial+Correspondences&rft.jtitle=arXiv.org&rft.au=Cembrano%2C+Javier&rft.au=Fischer%2C+Felix&rft.au=Klimm%2C+Max&rft.date=2023-01-11&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2301.04544 |