|
Price Of Anarchy In Congestion Games
The Price of Anarchy (PoA) is a concept in game theory and mechanism design that measures how the social welfare of a system degrades due to selfish behavior of its agents. It has been studied extensively in various contexts, particularly in congestion games (CG). Example The inefficiency of congestion games was first illustrated by Pigou in 1920, using the following simple congestion game. Suppose there are two roads that lead from point A to point B: * Road 1 is wide but slow. Using this road, it takes 1 minute to get from A to B, regardless of how many drivers use it. * Road 2 is fast but narrow, so it becomes congested and slower as more drivers use it. If ''x'' drivers use the road, it takes them x/1000 minutes to get from A to B. Suppose there are 1000 drivers who need to go from A to B. Each driver wants to minimize his own delay, but the government would like to minimize the total delay (the sum of delays of all drivers). * First, let us compute the minimum possible de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Price Of Anarchy
The Price of Anarchy (PoA) is a concept in economics and game theory that measures how the efficiency of a system degrades due to selfish behavior of its agents. It is a general notion that can be extended to diverse systems and notions of efficiency. For example, consider the system of transportation of a city and many agents trying to go from some initial location to a destination. Here, efficiency means the average time for an agent to reach the destination. In the 'centralized' solution, a central authority can tell each agent which path to take in order to minimize the average travel time. In the 'decentralized' version, each agent chooses its own path. The Price of Anarchy measures the ratio between average travel time in the two cases. Usually the system is modeled as a game and the efficiency is some function of the outcomes (e.g. maximum delay in a network, congestion in a transportation system, social welfare in an auction, etc.). Different concepts of equilibrium can be us ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cognitive Network
In communication networks, cognitive network (CN) is a new type of data network that makes use of cutting edge technology from several research areas (i.e. machine learning, knowledge representation, computer network, network management) to solve some problems current networks are faced with. Cognitive network is different from cognitive radio (CR) as it covers all the layers of the OSI model (not only layers 1 and 2 as with CR ). History The first definition of the cognitive network was provided by Theo Kanter in his doctoral research at KTH, The Royal Institute of Technology, Stockholm, including a presentation in June 1998 of the cognitive network as the network with memory. Theo was a student of Chip Maguire who also was advising Joe Mitola, the originator of cognitive radio. Mitola focused on cognition in the nodes, while Kanter focused on cognition in the network. Mitola's Licentiate thesis, published in August, 1999 includes the following quote "Over time, the adio K ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Congestion Pricing
Congestion pricing or congestion charges is a system of surcharging users of public goods that are subject to congestion through excess demand, such as through higher peak charges for use of bus services, electricity, metros, railways, telephones, and road pricing to reduce traffic congestion; airlines and shipping companies may be charged higher fees for slots at airports and through canals at busy times. This pricing strategy regulates demand, making it possible to manage congestion without increasing supply. According to the economic theory behind congestion pricing, the objective of this policy is to use the price mechanism to cover the social cost of an activity where users otherwise do not pay for the negative externalities they create (such as driving in a congested area during peak demand). By setting a price on an over-consumed product, congestion pricing encourages the redistribution of the demand in space or in time, leading to more efficient outcomes. Si ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Comparative Statics
In economics, comparative statics is the comparison of two different economic outcomes, before and after a change in some underlying exogenous variable, exogenous parameter. As a type of ''static analysis'' it compares two different economic equilibrium, equilibrium states, after the process of adjustment (if any). It does not study the motion towards equilibrium, nor the process of the change itself. Comparative statics is commonly used to study changes in supply and demand when analyzing a single Market (economics), market, and to study changes in monetary policy, monetary or fiscal policy when analyzing the whole macroeconomics, economy. Comparative statics is a tool of analysis in microeconomics (including general equilibrium analysis) and macroeconomics. Comparative statics was formalized by Sir John Richard Hicks, John R. Hicks (1939) and Paul A. Samuelson (1947) (Kehoe, 1987, p. 517) but was presented graphically from at least the 1870s. For models of stable equili ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cost Sharing
Costs are shared when more than one party pays towards the total costs, or accounted for separately across a number of activities or projects. In health care, cost sharing occurs when patients pay for a portion of health care costs not covered by health insurance. The "out-of-pocket" payment varies among healthcare plans and depends on whether or not the patient chooses to use a healthcare provider who is contracted with the healthcare plan's network. Examples of out-of-pocket payments involved in cost sharing include copays, deductibles, and coinsurance. In accounting, cost sharing or matching means that portion of project or program costs not borne by the funding agency. It includes all contributions, including cash and in-kind, that a recipient makes to an award. If the award is federal, only acceptable non-federal costs qualify as cost sharing and must conform to other necessary and reasonable provisions to accomplish the program objectives. Cost sharing effort is included in t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Altruism
Altruism is the concern for the well-being of others, independently of personal benefit or reciprocity. The word ''altruism'' was popularised (and possibly coined) by the French philosopher Auguste Comte in French, as , for an antonym of egoism. He derived it from the Italian , which in turn was derived from Latin , meaning "alterity, other people" or "somebody else". Altruism may be considered a synonym of selflessness, the opposite of self-centeredness. Altruism is an important moral value in many cultures and religions. It can Moral circle expansion, expand beyond care for humans to include other Sentience, sentient beings and future generations. Altruism, as observed in populations of organisms, is when an individual performs an action at a cost to itself (in terms of e.g. pleasure and quality of life, time, probability of survival or reproduction) that benefits, directly or indirectly, another individual, without the expectation of reciprocity or compensation for that ac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logarithmic Function
{{mathematical disambiguation ...
Logarithmic can refer to: * Logarithm, a transcendental function in mathematics * Logarithmic scale, the use of the logarithmic function to describe measurements * Logarithmic spiral, * Logarithmic growth * Logarithmic distribution, a discrete probability distribution * Natural logarithm The natural logarithm of a number is its logarithm to the base of a logarithm, base of the e (mathematical constant), mathematical constant , which is an Irrational number, irrational and Transcendental number, transcendental number approxima ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Social Cost
Social cost in neoclassical economics is the sum of the private costs resulting from a transaction and the costs imposed on the consumers as a consequence of being exposed to the transaction for which they are not compensated or charged. In other words, it is the sum of private and external costs. This might be applied to any number of economic problems: for example, social cost of carbon has been explored to better understand the costs of carbon emissions for proposed economic solutions such as a carbon tax. Private costs refer to direct costs to the producer for producing the good or service. Social cost includes these private costs and the additional costs (or external costs) associated with the production of the good which are not accounted for by the free market. In short, when the consequences of an action cannot be taken by the initiator, we will have external costs in the society. We will have private costs when initiator can take responsibility for agent's action.de V. G ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regret (decision Theory)
In decision theory, regret aversion (or anticipated regret) describes how the human emotional response of regret can influence decision-making under uncertainty. When individuals make choices without complete information, they often experience regret if they later discover that a different choice would have produced a better outcome. This regret can be quantified as the difference in value between the actual decision made and what would have been the optimal decision in hindsight. Unlike traditional models that consider regret as merely a post-decision emotional response, the theory of regret aversion proposes that decision-makers actively anticipate potential future regret and incorporate this anticipation into their current decision-making process. This anticipation can lead individuals to make choices specifically designed to minimize the possibility of experiencing regret later, even if those choices are not optimal from a purely probabilistic expected-value perspective. Regre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Éva Tardos
Éva Tardos (born 1 October 1957) is a Hungarian mathematician and the Jacob Gould Schurman Professor of Computer Science at Cornell University. Tardos's research interest is algorithms. Her work focuses on the design and analysis of efficient methods for combinatorial optimization problems on graphs or networks. She has done some work on network flow algorithms like approximation algorithms for network flows, cut, and clustering problems. Her recent work focuses on algorithmic game theory and simple auctions. Education and career Tardos received her Dipl. Math in 1981 and her Ph.D. 1984 from the Faculty of Sciences of the Eötvös Loránd University under her advisor András Frank. She was the Chair of the Department of Computer Science at Cornell from 2006 to 2010, and she is currently serving as the Associate Dean of the College of Computing and Information Science. She was editor-in-Chief of ''SIAM Journal on Computing'' from 2004 to 2009, and is currently the Economics a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tim Roughgarden
Timothy Avelin Roughgarden (born July 20, 1975) is an American computer scientist and a professor of Computer Science at Columbia University. Roughgarden's work deals primarily with game theoretic questions in computer science. Roughgarden received his Ph.D. from Cornell University in 2002, under the supervision of Éva Tardos. He did a postdoc at University of California, Berkeley in 2004. From 2004 to 2018, Roughgarden was a professor at the Computer Science department at Stanford University working on algorithms and game theory. Roughgarden teaches a four-part algorithms specialization on Coursera. He received the Danny Lewin award at STOC 2002 for the best student paper. He received the Presidential Early Career Award for Scientists and Engineers in 2007, the Grace Murray Hopper Award in 2009, and the Gödel Prize in 2012 for his work on routing traffic in large-scale communication networks to optimize performance of a congested network. He received a Guggenheim Fellowshi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Series–parallel Graph
In graph theory, series–parallel graphs are graphs with two distinguished vertices called ''terminals'', formed recursively by two simple composition operations. They can be used to model series and parallel electric circuits. Definition and terminology In this context, the term graph means multigraph. There are several ways to define series–parallel graphs. First definition The following definition basically follows the one used by David Eppstein. A two-terminal graph (TTG) is a graph with two distinguished vertices, ''s'' and ''t'' called ''source'' and ''sink'', respectively. The parallel composition ''Pc = Pc(X,Y)'' of two TTGs ''X'' and ''Y'' is a TTG created from the disjoint union of graphs ''X'' and ''Y'' by merging the sources of ''X'' and ''Y'' to create the source of ''Pc'' and merging the sinks of ''X'' and ''Y'' to create the sink of ''Pc''. The series composition ''Sc = Sc(X,Y)'' of two TTGs ''X'' and ''Y'' is a TTG created from the disjoint union of gra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
