Correction: Basic Network Creation Games

Correction: Basic Network Creation Games

We prove a previously stated but incorrectly proved theorem: there is a diameter-3 graph in which replacing any edge $\{v, w\}$ of the graph with $\{v, w'\}$, for any vertex $w'$, does not decrease the total sum of distances from $v$ to all other nodes (a property called sum equilibrium ).

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on discrete mathematics 2014-01, Vol.28 (3), p.1638-1640
Hauptverfasser: Alon, Noga, Demaine, Erik D., Hajiaghayi, MohammadTaghi, Kanellopoulos, Panagiotis, Leighton, Tom
Format: Artikel
Sprache:eng
Schlagworte:
Games
Graphs
Mathematical analysis
Networks
Theorems
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1640
container_issue 3
container_start_page 1638
container_title SIAM journal on discrete mathematics
container_volume 28
creator Alon, Noga
Demaine, Erik D.
Hajiaghayi, MohammadTaghi
Kanellopoulos, Panagiotis
Leighton, Tom
description We prove a previously stated but incorrectly proved theorem: there is a diameter-3 graph in which replacing any edge $\{v, w\}$ of the graph with $\{v, w'\}$, for any vertex $w'$, does not decrease the total sum of distances from $v$ to all other nodes (a property called sum equilibrium ).
doi_str_mv 10.1137/140955343
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671625667</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1671625667</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2123-e273bc1f4ccafdacc562e087fbbb6ab94a8d5f0cfe43d4d403ee30d5b4be7a913</originalsourceid><addsrcrecordid>eNo9kMFKxDAURYMoWEcX_kGX46Ka17wkrTstOgqDbnRdkvQFqu1kTDqIf2-HEVf3cDncxWXsEvg1gNA3gLyWUqA4YhnMWGhAdcwyXs2MFYdTdpbSB-eACDJjyybESG7qw-Y2vzepd_kLTd8hfuZNJLPv85UZKZ2zE2-GRBd_uWDvjw9vzVOxfl09N3frwpVQioJKLawDj84Z3xnnpCqJV9pba5WxNZqqk547Tyg67JALIsE7adGSNjWIBVsedrcxfO0oTe3YJ0fDYDYUdqkFpUGVUik9q1cH1cWQUiTfbmM_mvjTAm_3b7T_b4hf5y1Qrw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1671625667</pqid></control><display><type>article</type><title>Correction: Basic Network Creation Games</title><source>LOCUS - SIAM's Online Journal Archive</source><creator>Alon, Noga ; Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Kanellopoulos, Panagiotis ; Leighton, Tom</creator><creatorcontrib>Alon, Noga ; Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Kanellopoulos, Panagiotis ; Leighton, Tom</creatorcontrib><description>We prove a previously stated but incorrectly proved theorem: there is a diameter-3 graph in which replacing any edge $\{v, w\}$ of the graph with $\{v, w'\}$, for any vertex $w'$, does not decrease the total sum of distances from $v$ to all other nodes (a property called sum equilibrium ).</description><identifier>ISSN: 0895-4801</identifier><identifier>EISSN: 1095-7146</identifier><identifier>DOI: 10.1137/140955343</identifier><language>eng</language><subject>Games ; Graphs ; Mathematical analysis ; Networks ; Theorems</subject><ispartof>SIAM journal on discrete mathematics, 2014-01, Vol.28 (3), p.1638-1640</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2123-e273bc1f4ccafdacc562e087fbbb6ab94a8d5f0cfe43d4d403ee30d5b4be7a913</citedby><cites>FETCH-LOGICAL-c2123-e273bc1f4ccafdacc562e087fbbb6ab94a8d5f0cfe43d4d403ee30d5b4be7a913</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,3172,27905,27906</link.rule.ids></links><search><creatorcontrib>Alon, Noga</creatorcontrib><creatorcontrib>Demaine, Erik D.</creatorcontrib><creatorcontrib>Hajiaghayi, MohammadTaghi</creatorcontrib><creatorcontrib>Kanellopoulos, Panagiotis</creatorcontrib><creatorcontrib>Leighton, Tom</creatorcontrib><title>Correction: Basic Network Creation Games</title><title>SIAM journal on discrete mathematics</title><description>We prove a previously stated but incorrectly proved theorem: there is a diameter-3 graph in which replacing any edge $\{v, w\}$ of the graph with $\{v, w'\}$, for any vertex $w'$, does not decrease the total sum of distances from $v$ to all other nodes (a property called sum equilibrium ).</description><subject>Games</subject><subject>Graphs</subject><subject>Mathematical analysis</subject><subject>Networks</subject><subject>Theorems</subject><issn>0895-4801</issn><issn>1095-7146</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNo9kMFKxDAURYMoWEcX_kGX46Ka17wkrTstOgqDbnRdkvQFqu1kTDqIf2-HEVf3cDncxWXsEvg1gNA3gLyWUqA4YhnMWGhAdcwyXs2MFYdTdpbSB-eACDJjyybESG7qw-Y2vzepd_kLTd8hfuZNJLPv85UZKZ2zE2-GRBd_uWDvjw9vzVOxfl09N3frwpVQioJKLawDj84Z3xnnpCqJV9pba5WxNZqqk547Tyg67JALIsE7adGSNjWIBVsedrcxfO0oTe3YJ0fDYDYUdqkFpUGVUik9q1cH1cWQUiTfbmM_mvjTAm_3b7T_b4hf5y1Qrw</recordid><startdate>201401</startdate><enddate>201401</enddate><creator>Alon, Noga</creator><creator>Demaine, Erik D.</creator><creator>Hajiaghayi, MohammadTaghi</creator><creator>Kanellopoulos, Panagiotis</creator><creator>Leighton, Tom</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>H8D</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201401</creationdate><title>Correction: Basic Network Creation Games</title><author>Alon, Noga ; Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Kanellopoulos, Panagiotis ; Leighton, Tom</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2123-e273bc1f4ccafdacc562e087fbbb6ab94a8d5f0cfe43d4d403ee30d5b4be7a913</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Games</topic><topic>Graphs</topic><topic>Mathematical analysis</topic><topic>Networks</topic><topic>Theorems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Alon, Noga</creatorcontrib><creatorcontrib>Demaine, Erik D.</creatorcontrib><creatorcontrib>Hajiaghayi, MohammadTaghi</creatorcontrib><creatorcontrib>Kanellopoulos, Panagiotis</creatorcontrib><creatorcontrib>Leighton, Tom</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>SIAM journal on discrete mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Alon, Noga</au><au>Demaine, Erik D.</au><au>Hajiaghayi, MohammadTaghi</au><au>Kanellopoulos, Panagiotis</au><au>Leighton, Tom</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Correction: Basic Network Creation Games</atitle><jtitle>SIAM journal on discrete mathematics</jtitle><date>2014-01</date><risdate>2014</risdate><volume>28</volume><issue>3</issue><spage>1638</spage><epage>1640</epage><pages>1638-1640</pages><issn>0895-4801</issn><eissn>1095-7146</eissn><abstract>We prove a previously stated but incorrectly proved theorem: there is a diameter-3 graph in which replacing any edge $\{v, w\}$ of the graph with $\{v, w'\}$, for any vertex $w'$, does not decrease the total sum of distances from $v$ to all other nodes (a property called sum equilibrium ).</abstract><doi>10.1137/140955343</doi><tpages>3</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0895-4801
ispartof SIAM journal on discrete mathematics, 2014-01, Vol.28 (3), p.1638-1640
issn 0895-4801
1095-7146
language eng
recordid cdi_proquest_miscellaneous_1671625667
source LOCUS - SIAM's Online Journal Archive
subjects Games
Graphs
Mathematical analysis
Networks
Theorems
title Correction: Basic Network Creation Games
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T19%3A16%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Correction:%20Basic%20Network%20Creation%20Games&rft.jtitle=SIAM%20journal%20on%20discrete%20mathematics&rft.au=Alon,%20Noga&rft.date=2014-01&rft.volume=28&rft.issue=3&rft.spage=1638&rft.epage=1640&rft.pages=1638-1640&rft.issn=0895-4801&rft.eissn=1095-7146&rft_id=info:doi/10.1137/140955343&rft_dat=%3Cproquest_cross%3E1671625667%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1671625667&rft_id=info:pmid/&rfr_iscdi=true