The blind bartender's problem

Richard Ehrenborg; Chris M. Skinner

doi:10.1016/0097-3165(95)90092-6

The blind bartender's problem

Richard Ehrenborg, Chris M. Skinner

Mathematics

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

We present a two-player game with restricted information for one of the players. The game takes place on a transitive group action. The winning strategies depend on chains of structures in the group action. We also study a modification of the game with further restrictions on one of the players.

Original language	English
Pages (from-to)	249-266
Number of pages	18
Journal	Journal of Combinatorial Theory - Series A
Volume	70
Issue number	2
DOIs	https://doi.org/10.1016/0097-3165(95)90092-6
State	Published - May 1995

Bibliographical note

Funding Information:
authors were supported by AT&T Bell Laboratories.

Funding

authors were supported by AT&T Bell Laboratories.

Funders	Funder number
AT&T Bell Laboratories

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0097-3165(95)90092-6

Cite this

@article{af832d814cce4298a42d15a742f04414,

title = "The blind bartender's problem",

abstract = "We present a two-player game with restricted information for one of the players. The game takes place on a transitive group action. The winning strategies depend on chains of structures in the group action. We also study a modification of the game with further restrictions on one of the players.",

author = "Richard Ehrenborg and Skinner, \{Chris M.\}",

note = "Funding Information: authors were supported by AT\&T Bell Laboratories.",

year = "1995",

month = may,

doi = "10.1016/0097-3165(95)90092-6",

language = "English",

volume = "70",

pages = "249--266",

number = "2",

}

TY - JOUR

T1 - The blind bartender's problem

AU - Ehrenborg, Richard

AU - Skinner, Chris M.

N1 - Funding Information: authors were supported by AT&T Bell Laboratories.

PY - 1995/5

Y1 - 1995/5

N2 - We present a two-player game with restricted information for one of the players. The game takes place on a transitive group action. The winning strategies depend on chains of structures in the group action. We also study a modification of the game with further restrictions on one of the players.

AB - We present a two-player game with restricted information for one of the players. The game takes place on a transitive group action. The winning strategies depend on chains of structures in the group action. We also study a modification of the game with further restrictions on one of the players.

UR - http://www.scopus.com/inward/record.url?scp=58149212529&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58149212529&partnerID=8YFLogxK

U2 - 10.1016/0097-3165(95)90092-6

DO - 10.1016/0097-3165(95)90092-6

M3 - Article

AN - SCOPUS:58149212529

SN - 0097-3165

VL - 70

SP - 249

EP - 266

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

IS - 2

ER -

The blind bartender's problem

Abstract

Bibliographical note

Funding

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this