International Journal of Game Theory

1983 - 2026

Current editor(s): Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

From:
Springer
Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 42, issue 4, 2013

Algorithms for lattice games pp. 777-788

Alan Guo and Ezra Miller

Timing of messages and the Aumann conjecture: a multiple-selves approach pp. 789-800

Ro'i Zultan

Non-symmetric discrete General Lotto games pp. 801-833

Marcin Dziubiński

Matching and price competition: beyond symmetric linear costs pp. 835-844

Julio González-Díaz and Ron Siegel

Picking the winners pp. 845-865

Pablo Amoros

Correlation through bounded recall strategies pp. 867-890

Ron Peretz

A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron–Frobenius theory pp. 891-915

Endre Boros, Vladimir Gurvich and Vladimir Oudalov

Optimal strategies for a game on amenable semigroups pp. 917-929

Valerio Capraro and Kent Morrison

Information elicitation and sequential mechanisms pp. 931-946

Inbar Aricha and Rann Smorodinsky

Values of nondifferentiable vector measure games pp. 947-972

Omer Edhan

Stochastic bankruptcy games pp. 973-988

Helga Habis and P. Jean-Jacques Herings

Value function of differential games without Isaacs conditions. An approach with nonanticipative mixed strategies pp. 989-1020

Rainer Buckdahn, Juan Li and Marc Quincampoix

Analysis of stochastic matching markets pp. 1021-1040

Péter Biró and Gethin Norman

Imitation, local interaction, and coordination pp. 1041-1057

Hsiao-Chi Chen, Yunshyong Chow and Li-Chau Wu

On the approximation performance of fictitious play in finite games pp. 1059-1083

Paul Goldberg, Rahul Savani, Troels Sørensen and Carmine Ventre

Representation of finite games as network congestion games pp. 1085-1096

Igal Milchtaich

Volume 42, issue 3, 2013

Introduction to the special issue pp. 563-566

Giacomo Bonanno, Andreas Herzig, Wiebe Hoek and Jérôme Lang

AGM-consistency and perfect Bayesian equilibrium. Part I: definition and properties pp. 567-592

Giacomo Bonanno

Bounded rationality, strategy simplification, and equilibrium pp. 593-611

Hubie Chen

Where do preferences come from? pp. 613-637

Franz Dietrich and Christian List

Program equilibrium—a program reasoning approach pp. 639-671

Wiebe Hoek, Cees Witteveen and Michael Wooldridge

Stability and fairness in models with a multiple membership pp. 673-694

Michel Le Breton, Juan Moreno-Ternero, Alexey Savvateev and Shlomo Weber

Wisdom of crowds versus groupthink: learning in groups and in isolation pp. 695-723

Conor Mayo-Wilson, Kevin Zollman and David Danks

Awareness-dependent subjective expected utility pp. 725-753

Burkhard Schipper

Epistemic characterizations of iterated deletion of inferior strategy profiles in preference-based type spaces pp. 755-776

Michael Trost

Volume 42, issue 2, 2013

Monotonic core solutions: beyond Young’s theorem pp. 325-337

J. Arin

On the core: complement-reduced game and max-reduced game pp. 339-355

Yan-An Hwang

On membership and marginal values pp. 357-373

Norman Kleinberg and Jeffrey Weiss

Farsighted free trade networks pp. 375-398

Jin Zhang, Licun Xue and Lei Zu

Almost common priors pp. 399-410

Ziv Hellman

On Dedekind’s problem for complete simple games pp. 411-437

Sascha Kurz and Nikolas Tautenhahn

A discrete cost sharing model with technological cooperation pp. 439-460

Eric Bahel and Christian Trudeau

Strong equilibria in games with the lexicographical improvement property pp. 461-482

Tobias Harks, Max Klimm and Rolf Möhring

Contractually stable networks pp. 483-499

Jean-François Caulier, Ana Mauleon and Vincent Vannetelbosch

Efficiency and compromise: a bid-offer–counteroffer mechanism with two players pp. 501-520

Yuan Ju

One-to-many non-cooperative matching games pp. 521-539

Yujiro Kawasaki

Coarse correlated equilibria in linear duopoly games pp. 541-562

Indrajit Ray and Sonali Sen Gupta

Volume 42, issue 1, 2013

Three hierarchies of simple games parameterized by “resource” parameters pp. 1-17

Tatiana Gvozdeva, Lane Hemaspaandra and Arkadii Slinko

An alternative characterization of the deferred acceptance algorithm pp. 19-28

Thayer Morrill

Strategic cooperation in cost sharing games pp. 29-53

Martin Hoefer

Common learning with intertemporal dependence pp. 55-98

Martin Cripps, Jeffrey Ely, George Mailath and Larry Samuelson

Trimmed equilibrium pp. 99-114

Valeska Groenert

Coalitional unanimity versus strategy-proofness in coalition formation problems pp. 115-130

Koji Takamiya

Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines pp. 131-163

Conan Mukherjee

The equivalence of linear programs and zero-sum games pp. 165-177

Ilan Adler

Co-evolutionary dynamics and Bayesian interaction games pp. 179-210

Mathias Staudigl

On the existence and uniqueness of pairwise stable networks pp. 211-237

Tim Hellmann

Cooperative Markov decision processes: time consistency, greedy players satisfaction, and cooperation maintenance pp. 239-262

Konstantin Avrachenkov, Laura Cottatellucci and Lorenzo Maggi

Disagreement and evidence production in strategic information transmission pp. 263-282

Peter Eso and Ádám Galambos

Delayed perfect monitoring in repeated games pp. 283-294

Markus Kinateder

On the feasible payoff set of two-player repeated games with unequal discounting pp. 295-303

Bo Chen and Satoru Fujishige

“Procedural” values for cooperative games pp. 305-324

Marcin Malawski