English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we study a variant of the Malicious Ma\^{i}tre d' problem. Thisproblem, attributed to computer scientist Rob Pike in Peter Winkler's book"Mathematical Puzzles: A Connoisseur's Collection", involves seating dinersaround a circular table with napkins placed between each pair of adjacentsettings. The goal of the ma\^{i}tre d' is to seat the diners in a way thatmaximizes the number of diners who arrive at the table to find the napkins onboth the left and right of their place already taken by their neighbors.Previous work described a seating algorithm in which the ma\^{i}tre d' expectsto force about 18% of the diners to be napkinless. In this paper, we show thatif the ma\^{i}tre d' learns each diner's preference for the right or leftnapkin before they are placed at the table, this expectation jumps to nearly$1/3$ (and converges to $1/3$ as the table size gets large). Moreover, ourstrategy is optimal for every sequence of diners' preferences.

The clairvoyant ma\^{i}tre d'