Country: Germany

Found 3096 papers in total
Evidence based rules and learning in symmetric normal-form games
Evidence based rules and learning in symmetric normal-form games
1999,
We put forth a general theory of boundedly rational behavior and learning for...
Does observation of others affect learning in strategic environments? An experimental study
Does observation of others affect learning in strategic environments? An experimental study
1999,
This paper presents experimental results from an analysis of two similar games, the...
The core of an economy with a common pool resource: A partition function form approach
The core of an economy with a common pool resource: A partition function form approach
1999,
In this paper we consider a model of an economy with a common pool resource. Under...
Weighted nucleoli
Weighted nucleoli
1999,
Cooperative games in characteristic function form (TU games) are considered. We allow...
Fictitious play in coordination games
Fictitious play in coordination games
1999,
We study the Fictitious Play process with bounded and unbounded recall in pure...
The speed of rational learning
The speed of rational learning
1999,
A central result in the rational learning literature is that if the true measure is...
Prosperity properties of TU-games
Prosperity properties of TU-games
1999,
An important open problem in the theory of TU-games is to determine whether a game has...
On the bargaining set, kernel and core of superadditive games
On the bargaining set, kernel and core of superadditive games
1999,
We prove that for superadditive games a necessary and sufficient condition for the...
Strategic behavior of experienced subjects in a common pool resource game
Strategic behavior of experienced subjects in a common pool resource game
1999,
This paper describes the results of an experiment applying the strategy method to...
On some properties of the ϵ-core of games with coalition structure
On some properties of the ϵ-core of games with coalition structure
1999,
Chang stated some inclusion relations for kernel, reasonable set, and ϵ-core of...
Bimatrix games have quasi-strict equilibria
Bimatrix games have quasi-strict equilibria
1999,
In this paper we show that every bimatrix game has at least one quasi-strict...
Two-person bilateral many-rounds poker
Two-person bilateral many-rounds poker
1999,
This paper analyses a game-theoretic model of Hi-Lo Poker. Bilateral-move N -round...
Repeated games with incomplete information and transportation problems
Repeated games with incomplete information and transportation problems
1999,
We consider two person zero-sum repeated games with lack of information on one side...
Perishable inventory systems with impatient demands
Perishable inventory systems with impatient demands
1999,
An inventory system for perishable commodities (PIS) with finite shelf size and finite...
Edge-augmentation of hypergraphs
Edge-augmentation of hypergraphs
1999,
Let G be a connected hypergraph. We give a min–max relation for the minimum...
Augmenting hypergraphs by edges of size two
Augmenting hypergraphs by edges of size two
1999,
We give a good characterization for the minimum number of edges of size two whose...
Covering symmetric supermodular functions by graphs
Covering symmetric supermodular functions by graphs
1999,
The minimum number of edges of an undirected graph covering a symmetric, supermodular...
Covering and structure of crossing families
Covering and structure of crossing families
1999,
Let ℱ be a symmetric and crossing family of subsets of V . Our first result is a...
Hypergraph connectivity augmentation
Hypergraph connectivity augmentation
1999,
The hypergraph augmentation problem is to augment a hypergraph by hyperedges to meet...
A 1-(S, T)-edge-connectivity augmentation algorithm
A 1-(S, T)-edge-connectivity augmentation algorithm
1999,
We present a combinatorial algorithm for the 1-( S, T )-edge-connectivity augmentation...
Directed vertex-connectivity augmentation
Directed vertex-connectivity augmentation
1999,
The problem of finding a smallest set of new edges to be added to a given directed...
How to make a graph four-connected
How to make a graph four-connected
1999,
Two extremal-type versions of the connectivity augmentation problem are investigated....
Increasing the rooted-connectivity of a digraph by one
Increasing the rooted-connectivity of a digraph by one
1999,
D.R. Fulkerson described a two-phase greedy algorithm to find a minimum cost spanning...
Successive edge-connectivity augmentation problems
Successive edge-connectivity augmentation problems
1999,
It was known that for undirected edge-connectivity (and for uniform demands) the...
Papers per page: