Results 111 to 120 of about 26,202 (266)
NASH EQUILIBRIA IN A MODEL OF MULTIPRODUCT PRICE COMPETITION: AN ASSIGNMENT PROBLEM [PDF]
We study the market interaction of a finite number of single-product firms and a representative buyer, where the buyer consumes bundles of these goods. The buyers' value function determines their willingness to pay for subsets of goods.
Amparo Urbano, Ivan Arribas
core
To deal with resource allocation in heterogeneous wireless networks,an algorithm based on multi-leader multi-follower Stackelberg games model was proposed to satisfy optimal utility of both operators and mobile users.The mobile user’s utility function ...
Yong JIANG, Shan-zhi CHEN, Bo HU
doaj +2 more sources
Perfect Regular Equilibrium [PDF]
We propose a revised version of the perfect Bayesian equilibrium in general multi-period games with observed actions. In finite games, perfect Bayesian equilibria are weakly consistent and subgame perfect Nash equilibria.
hanjoon michael, jung/j
core
Continuous-Time Games of Timing [PDF]
We address the question of existence of equilibrium in general timing games of complete information. Under weak assumptions, any two-player timing game has a subgame perfect e-equilibrium, for each e > 0. This result is tight.
Eilon, SOLAN +2 more
core
Exploring the Gap between Perfect Bayesian Equilibrium and Sequential Equilibrium
In (Bonanno, 2013), a solution concept for extensive-form games, called perfect Bayesian equilibrium (PBE), was introduced and shown to be a strict refinement of subgame-perfect equilibrium; it was also shown that, in turn, sequential equilibrium (SE) is
Giacomo Bonanno
doaj +1 more source
AGM-consistency and perfect Bayesian equilibrium. Part I: definition and properties. [PDF]
We provide a general notion of perfect Bayesian equilibrium which can be applied to arbitrary extensive-form games and is intermediate between subgame-perfect equilibrium and sequential equilibrium.
Giacomo Bonanno
core
Strategy Derivation for Small Progress Measures [PDF]
Small Progress Measures is one of the most efficient parity game solving algorithms. The original algorithm provides the full solution (winning regions and strategies) in $O(dm \cdot (n/\lceil d / 2 \rceil)^{\lceil d/2 \rceil})$ time, and requires a re ...
Gazda, Maciej, Willemse, Tim A. C.
core
Constrained existence problem for weak subgame perfect equilibria with\n omega-regular Boolean objectives (full version) [PDF]
Thomas Brihaye +3 more
openalex +2 more sources
Undercut-proof Subgame Perfect Equilibrium of a Pricing Game [PDF]
Two firms selling a homogenous product to two types of buyers are involved in a sequential pricing game with zero costs. The pricing strategy available involves a fixed price and a royalty.
Debabrata Datta, Jaideep Roy
core
Endogenous Timing of Moves in Bertrand-Edgeworth Triopolies [PDF]
We determine the endogenous order of moves in which the firms set their prices in the framework of a capacity-constrained Bertrand-Edgeworth triopoly. A three-period timing game that determines the period in which the firms announce their prices precedes
Tasnádi, Attila
core

