Search results for " game theory"
showing 10 items of 120 documents
A Game Theory Approach and Tariff Strategy for Demand Side Management
2018
Demand side management in smart grid environment with smart meters, renewable energy sources, different kind of consumers etc. is a complex problem. To optimize the problem game theory methodology is used. Game theory approach provide win-win situation between consumers and utilities. Objective of the paper is to find the Nash equilibrium between consumer and utility when utility is supplied through green energy sources. Mathematical modeling of consumption and utilization derived a Nash equilibrium point where consumer and utility both get maximum payoffs. Results shows that energy consumption cost is reduce by applying game theory approach.
On robustness and dynamics in (un)balanced coalitional games
2012
In this paper we investigate robustness and dynamics for coalitional games with transferable utilities (TU games). In particular we study sequences of TU games. These sequences model dynamic situations in which the values of coalitions of players are not known beforehand, and are subject to changes over time. An allocation rule assigns a payoff to each player in each time period. This payoff is bounded by external restrictions, for example due to contractual agreements. Our main questions are: (i) under which conditions do the allocations converge to a core-element of the game, and (ii) when do the allocations converge to some specific allocation, the so-called nominal allocation? The main …
Claws contained in all n-tournaments
1993
Abstract We prove that any claw of order n with degree d≤ 3 8 n is n-unavoidable, which means that any tournament of order n contains it as a subdigraph. A simple corollary is that any tournament has a directed Hamiltonian path.
On symmetric nonlocal games
2013
Abstract Nonlocal games are used to display differences between the classical and quantum world. In this paper, we study symmetric XOR games, which form an important subset of nonlocal games. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player. We illustrate those methods with two examples. One example is an N -player game (due to Ardehali (1992) [3] ) that provides the maximum quantum-over-classical advantage. The second example comes from generalization of CHSH game by letting the referee to choose arbitrary symmetric distribution of players’ inputs.
Graph connectivity and monadic NP
2002
Ehrenfeucht games are a useful tool in proving that certain properties of finite structures are not expressible by formulas of a certain type. In this paper a new method is introduced that allows the extension of a local winning strategy for Duplicator, one of the two players in Ehrenfeucht games, to a global winning strategy. As an application it is shown that graph connectivity cannot be expressed by existential second-order formulas, where the second-order quantification is restricted to unary relations (monadic NP), even, in the presence of a built-in linear order. As a second application it is stated, that, on the other hand, the presence of a linear order increases the power of monadi…
Cooperation among competitors: A comparison of cost-sharing mechanisms
2016
Abstract In this paper, we investigate the consequences of using outcome-based versus ex ante-based cost-sharing mechanisms in terms of competing firms' profitability and total welfare. We consider two firms making a joint expenditure, which can positively affect firms' demand and/or unit operating costs, while competing in the final market by setting either price or quantity. We compare two outcome-based cost-sharing mechanisms, i.e., Quantity Proportional (QP) and Total Margin proportional (TM), with the more competitive Fixed Share (FS) mechanism where cost-sharing is set up on an ex ante basis. We show that outcome-based mechanisms, and even a fully collusive behavior induced by the opt…
Two-Player Noncooperative Games over a Freight Transportation Network''
2004
A game between two players acting on the same road transportation network is considered in this paper. The first player aims at minimizing the transportation costs, whereas the second player aims at maximizing her profit (or, in general, her utility) that is proportional to the flow passing through the arcs under her control. We introduce bilevel linear programming formulations for this problem. We derive conditions of existence and properties of the equilibrium points and propose an algorithm finding a local optimal solution. Finally, we present an application of the model to a real system involving trucks travelling through Europe from a Middle Eastern country.
FlashRL: A Reinforcement Learning Platform for Flash Games
2017
Reinforcement Learning (RL) is a research area that has blossomed tremendously in recent years and has shown remarkable potential in among others successfully playing computer games. However, there only exists a few game platforms that provide diversity in tasks and state-space needed to advance RL algorithms. The existing platforms offer RL access to Atari- and a few web-based games, but no platform fully expose access to Flash games. This is unfortunate because applying RL to Flash games have potential to push the research of RL algorithms. This paper introduces the Flash Reinforcement Learning platform (FlashRL) which attempts to fill this gap by providing an environment for thousands of…
Election Manipulation on Social Networks with Messages on Multiple Candidates
2019
We study the problem of election control through social influence when the manipulator is allowed to use the locations that she acquired on the network for sending \emph{both} positive and negative messages on \emph{multiple} candidates, widely extending the previous results available in the literature that study the influence of a single message on a single candidate. In particular, we provide a tight characterization of the settings in which the maximum increase in the margin of victory can be efficiently approximated and of those in which any approximation turns out to be impossible. We also show that, in simple networks, a large class of algorithms, mainly including all approaches recen…
Visibly pushdown modular games,
2014
Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a module and is oblivious to previous module invocations, and thus does not depend on the context of invocation. In this work, we study for the first time modular strategies with respect to winning conditions that can be expressed by a pushdown automaton. We show that such games are undecidable in general, and become decidable for visibly pushdown automata specifications. Our solution relies on a reduction to modular games with finite-state automat…