Matthew L. Ginsberg
Matthew Ginsberg studies reasoning and search in games where a computer has limited information about the state of play. Ginsberg’s GIB paper appeared in the Journal of Artificial Intelligence Research in 2001. It studies building a contract bridge program and distinguishes full-information card play from the hidden-information problems of actual bridge. The GIB study describes partition search, Monte Carlo techniques, achievable sets, and extensions of alpha-beta pruning.
- Works
- 92
- Citations
- 5,453
- h-index
- 30
Publication numbers from OpenAlex, as of 14 October 2026.
Timeline
-
1995
Research recognition
AAAI elected Matthew L. Ginsberg as a Fellow in 1995.
-
2001
GIB bridge research
Ginsberg’s GIB paper appeared in the Journal of Artificial Intelligence Research in 2001. It studies building a contract bridge program and distinguishes full-information card play from the hidden-information problems of actual bridge.
-
As of October 2026
Search and sampling methods
The GIB study describes partition search, Monte Carlo techniques, achievable sets, and extensions of alpha-beta pruning.
-
As of October 2026
Optimising card play
The paper also uses squeaky wheel optimisation to seek approximately optimal card-play solutions.
Sources and credits
Photo: news.uoregon.edu; The Crossing Guard | OregonNews; creator not stated. License: Not stated by source. Source: news.uoregon.edu. Cropped to a square and resized. Ask us to remove or replace this photo.