Sciweavers

IJHPCA
2016
52views more  IJHPCA 2016»
10 years 1 months ago
Scaling up Hartree-Fock calculations on Tianhe-2
This paper presents a new optimized and scalable code for Hartree–Fock self-consistent field iterations. Goals of the code design include scalability to large numbers of nodes,...
Edmond Chow, Xing Liu, Sanchit Misra, Marat Dukhan...
IJGT
2016
67views more  IJGT 2016»
10 years 1 months ago
Feasibility and individual rationality in two-person Bayesian games
We de…ne feasible, posterior individually rational solutions for twoperson Bayesian games with a single informed player. Such a solution can be achieved by direct signalling fro...
Françoise Forges, Ulrich Horst, Antoine Sal...
IJGT
2016
69views more  IJGT 2016»
10 years 1 months ago
On the dispensable role of time in games of perfect information
In Aumann (1995) and Aumann (1998), time is assumed implicitly in the description of games of perfect information, and it is part of the epistemic distinction between ex-ante and e...
Dov Samet
IJGT
2016
62views more  IJGT 2016»
10 years 1 months ago
Common-value all-pay auctions with asymmetric information and bid caps
We study a class of two-player common-value all-pay auctions (contests) with asymmetric information under the assumption that one of the players has an information advantage over ...
Ezra Einy, Ori Haimanko, Ram Orzach, Aner Sela
IJGS
2016
61views more  IJGS 2016»
10 years 1 months ago
A lattice-free concept lattice update algorithm
Updating a concept lattice when introducing new objects to input data can be done by any of the so-called incremental algorithms for computing concept lattice of the data. The algo...
Jan Outrata