Similar Search Results

Optimizing cooperative advertizing, profit sharing, and inventory policies in a VMI supply chain : a Nash bargaining model and hybrid algorithm

Jiang, Ning; Zhang, Linda L.; Yu, Yugang - In: IEEE transactions on engineering management : EM 62 (2015) 4, pp. 449-461

Persistent link: https://www.econbiz.de/10011392500

Priority-driven behaviors under the Boston mechanism

Cantala, David; Pereyra, Juan - In: Review of economic design : RED 21 (2017) 1, pp. 49-63

Persistent link: https://www.econbiz.de/10011900103

Homotopy methods to compute equilibria in game theory

Herings, Peter Jean-Jacques; Peeters, Ronald - 2006

Persistent link: https://www.econbiz.de/10003482985

Nash Game Model for Optimizing Market Strategies, Configuration of Platform Products in a Vendor Managed Inventory (Vmi) Supply Chain for a Product Family

Yu, Yugang - 2010

retailers. This paper combines analytical, iterative and GA (genetic algorithm) methods to develop a game solution algorithm to … find the Nash equilibrium. A numerical example is conducted to test the proposed model and algorithm, and gain managerial …

Persistent link: https://www.econbiz.de/10012757795

Existence, uniqueness, and algorithm for identifying free riders in multiple public good games : replacement function approach

Suzuki, Ken-ichi; Itaya, Jun-ichi; Yamanashi, Akitomo; … - 2018

using graph theory. This sufficient condition allows us to use the replacement function approach of Cornes and Hartley (2007 …) not only to develop an algorithm for identifying free riders, but also to provide an alternative proof for the uniqueness …

Persistent link: https://www.econbiz.de/10011853293

Technical note: characterizing and computing the set of nash equilibria via vector optimization

Feinstein, Zachary; Rudloff, Birgit - In: Operations research 72 (2024) 5, pp. 2082-2096

Persistent link: https://www.econbiz.de/10015361768

An elliptic algorithm for Nash-equilibria

Moltzahn, Siegmar - 1995

Persistent link: https://www.econbiz.de/10000549951

On the Existence of a Strictly Strong Nash Equilibrium under the Student Optimal DA Algorithm

Bando, Keisuke - 2013

This paper analyzes a preference revelation game in the student optimal deferred acceptance algorithm in a college … algorithm that finds it. In particular, (i) the equilibrium outcome by our algorithm is the same matching as in the efficiently …-adjusted deferred acceptance algorithm (Kesten, 2010) and (ii) in a one-to-one matching market, it coincides with the student …

Persistent link: https://www.econbiz.de/10014156803

Strategic Games and Algorithmic Secrecy

Cofone, Ignacio; Strandburg, Katherine J. - 2020

We challenge a claim commonly made by industry and government representatives and echoed by legal scholarship: that algorithmic decision-making processes are better kept opaque or secret because otherwise decision-subjects will “game the system”, leading to inaccurate or unfair results. We...

Persistent link: https://www.econbiz.de/10014104614

Algorithms May Not Learn to Play a Unique Nash Equilibrium

Fujiwara-Greve, Takako; Nielsen, Carsten - 2021

There is a widespread hope that, in the near future, algorithms become so sophisticated that ``solutions" to most problems are found by machines. In this note, we throw some doubts on this expectation by showing the following impossibility result: given a set of finite-memory, finite-iteration...

Persistent link: https://www.econbiz.de/10013241420