<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Gao_et_al_2013a</id>
		<title>Gao et al 2013a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Gao_et_al_2013a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Gao_et_al_2013a&amp;action=history"/>
		<updated>2026-04-23T15:21:25Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Gao_et_al_2013a&amp;diff=193657&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 312464811 to Gao et al 2013a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Gao_et_al_2013a&amp;diff=193657&amp;oldid=prev"/>
				<updated>2021-01-28T19:37:13Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_312464811&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 312464811&quot;&gt;Draft Content 312464811&lt;/a&gt; to &lt;a href=&quot;/public/Gao_et_al_2013a&quot; title=&quot;Gao et al 2013a&quot;&gt;Gao et al 2013a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 19:37, 28 January 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Gao_et_al_2013a&amp;diff=193656&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  In this paper, we study the tradeoff between two important traffic engineering objectives: load balance and energy efficiency. Although traditional commonly u...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Gao_et_al_2013a&amp;diff=193656&amp;oldid=prev"/>
				<updated>2021-01-28T19:37:09Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  In this paper, we study the tradeoff between two important traffic engineering objectives: load balance and energy efficiency. Although traditional commonly u...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
In this paper, we study the tradeoff between two important traffic engineering objectives: load balance and energy efficiency. Although traditional commonly used multi-objective optimization methods can yield a Pareto efficient solution, they need to construct an aggregate objective function (AOF) or model one of the two objectives as a constraint in the optimization problem formulation. As a result, it is difficult to achieve a fair tradeoff between these two objectives. Accordingly, we induce a Nash bargaining framework which treats the two objectives as two virtual players in a game theoretic model, who negotiate how traffic should be routed in order to optimize both objectives. During the negotiation, each of them announces its performance threat value to reduce its cost, so the model is regarded as a threat value game. Our analysis shows that no agreement can be achieved if each player sets its threat value selfishly. To avoid such a negotiation break-down, we modify the threat value game to have a repeated process and design a mechanism to not only guarantee an agreement, but also generate a fair solution. In addition, the insights from this work are also useful for achieving a fair tradeoff in other multi-objective optimization problems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://www.cse.buffalo.edu/tech-reports/2012-02a.pdf http://www.cse.buffalo.edu/tech-reports/2012-02a.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/6556116/6566708/06566829.pdf?arnumber=6566829 http://xplorestaging.ieee.org/ielx7/6556116/6566708/06566829.pdf?arnumber=6566829],&lt;br /&gt;
: [http://dx.doi.org/10.1109/infcom.2013.6566829 http://dx.doi.org/10.1109/infcom.2013.6566829]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/infocom/infocom2013.html#ZhaoWXWGQ13 https://dblp.uni-trier.de/db/conf/infocom/infocom2013.html#ZhaoWXWGQ13],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/6566829 https://ieeexplore.ieee.org/document/6566829],&lt;br /&gt;
: [https://ubir.buffalo.edu/xmlui/handle/10477/34633 https://ubir.buffalo.edu/xmlui/handle/10477/34633],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/1995699326 https://academic.microsoft.com/#/detail/1995699326]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>