Some online Maker-Breaker games

IF 1.1 3区 数学 Q2 MATHEMATICS Discrete Mathematics Pub Date : 2025-06-01 Epub Date: 2025-02-19 DOI:10.1016/j.disc.2025.114446
Patrick Bennett , Alan Frieze
{"title":"Some online Maker-Breaker games","authors":"Patrick Bennett ,&nbsp;Alan Frieze","doi":"10.1016/j.disc.2025.114446","DOIUrl":null,"url":null,"abstract":"<div><div>We consider some Maker-Breaker games of the following flavor. We have some set <em>V</em> of items for purchase. Maker's goal is to purchase some member of a given family <span><math><mi>H</mi></math></span> of subsets of <em>V</em> as cheaply as possible and Breaker's goal is to make the purchase as expensive as possible. Each player has a pointer and during a player's turn their pointer moves through the items in the order of the permutation until the player decides to take one. We mostly focus on the case where the permutation is random and unknown to the players (it is revealed by the players as their pointers move).</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 6","pages":"Article 114446"},"PeriodicalIF":1.1000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X25000548","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/19 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We consider some Maker-Breaker games of the following flavor. We have some set V of items for purchase. Maker's goal is to purchase some member of a given family H of subsets of V as cheaply as possible and Breaker's goal is to make the purchase as expensive as possible. Each player has a pointer and during a player's turn their pointer moves through the items in the order of the permutation until the player decides to take one. We mostly focus on the case where the permutation is random and unknown to the players (it is revealed by the players as their pointers move).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一些在线创客游戏
我们考虑了一些以下风格的Maker-Breaker游戏。我们有几组物品需要购买。Maker的目标是尽可能便宜地购买V的子集H中的某个成员,而Breaker的目标是使购买尽可能昂贵。每个玩家都有一个指针,在玩家的回合中,他们的指针按照排列顺序移动物品,直到玩家决定拿一个。我们主要关注的是排列是随机的,玩家不知道的情况(游戏邦注:这是玩家在指针移动时发现的)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Mathematics
Discrete Mathematics 数学-数学
CiteScore
1.50
自引率
12.50%
发文量
424
审稿时长
6 months
期刊介绍: Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.
期刊最新文献
Online Ramsey numbers of ordered graphs Chorded cycles in Chvátal-Erdős graphs Edge condition and chorded cycles in balanced bipartite graphs Coloring game on complete multipartite with singletons and equal sized parts A combinatorial proof of an inequality on some partitions separated by parity
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1