搜索结果: 1-13 共查到“Nash Equilibrium”相关记录13条 . 查询时间(0.142 秒)
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir
TFNP PPAD Nash Equilibrium
2019/5/23
The Fiat-Shamir heuristic transforms a public-coin interactive proof into a non-interactive argument, by replacing the verifier with a cryptographic hash function that is applied to the protocol’s tra...
On the Cryptographic Hardness of Finding a Nash Equilibrium
obfuscation nash equilibrium PPAD
2016/1/5
We prove that finding a Nash equilibrium of a game is hard, assuming the existence of indistinguishability
obfuscation and one-way functions with sub-exponential hardness. We do so by showing
how th...
On the Exact Cryptographic Hardness of Finding a Nash Equilibrium
The exact hardness of computing cryptography
2015/12/21
The exact hardness of computing a Nash equilibrium is a fundamental open question in
algorithmic game theory. This problem is complete for the complexity class PPAD. It is well
known that problems i...
Correlated Equilibrium and Nash Equilibrium as an Observer's Assessment of the Game
Decision Choices and Conditions Game Theory Cooperation
2015/4/21
Noncooperative games are examined from the point of view of an outside observer who believes that the players are rational and that they know at least as much as the observer. The observer is assumed ...
Equivalent Bilevel Programming Form for the Generalized Nash Equilibrium Problem
Generalized Nash equilibrium point Bilevel Programming efficient solution optimal solution
2011/11/17
Generalized Nash Equilibrium problem is widely used but hard to solve. In this paper, we transform the generalized Nash game into a special bilevel programming with one leader and multi-followers by s...
If a game has a Nash equilibrium with probability values that are either zero or Omega(1) then this equilibrium can be found exhaustively in polynomial time. Somewhat surprisingly, we show that there ...
On the Existence of Bertrand-Nash Equilibrium Prices Under Logit Demand
Bertrand-Nash Equilibrium Prices Logit Demand
2011/1/4
This article presents a proof of the existence of Bertrand-Nash equilibrium prices with multi-product firms and under the Logit model of demand that does not rely on restrictive assumptions on product...
Fixed-Point Approaches to Computing Bertrand-Nash Equilibrium Prices Under Mixed Logit Demand: A Technical Framework for Analysis and Efficient Computational Methods
Mixed Logit Demand Technical Framework Analysis Efficient Computational Methods
2011/2/28
Bertrand competiton has been a prominent paradigm for the empirical study of differentiated
product markets for at least twenty years. Firms engaged in Bertrand competition maximize profits by choosi...
On the Structure of Nash Equilibrium Sets in Partially Convex Games
Nash Equilibrium Partially Convex Games
2009/2/5
The paper describes the geometrical structure of Nash equilibrium sets in partially convex games without constraints. A condition characterizing a distinct class of Nash equilibrium sets is given. A c...
Two-party political competition: A geometric study of the Nash equilibrium in a weighted case
Computational Geometry Operational Research
2010/9/16
This paper investigates an abstract game of political competition between two parties. All political positions are represented by points in a plane, and the parties choose positions that are as close ...
2004Vol.41No.4pp.553-556DOI:
Generalized Quantum Games with Nash
Equilibrium
LIU Xu-Feng
Department of Mathematics, Peking University, Beijing 100871, China
Institute of...
主讲人
Zhao Jingang 教授
加拿大University of Saskatchewan
题目
Equivalence between the Existence Theorems on Nash Equilibrium, Core and Hybrid Equilibrium
时间
2005年5月18日（星期三）下午2:00-3:30
地点
北京大学中国经济研究中心万众楼小教室
工作语...
We prove that the problem of finding a Nash equilibrium in a two-player game is PPAD-complete.