Lean module · Foundations
BanditRLProof.Algorithms.MusicalChairsCoordinationRegret
Generated source map for this Lean module.
Module map
Imports
BanditRLProof.Algorithms.MusicalChairsCoordinationTime
Imported by
BanditRLProof, BanditRLProof.Algorithms.MusicalChairsExploration, BanditRLProof.Algorithms.MusicalChairsLearnerRegret, BanditRLProof.Algorithms.MusicalChairsMarginal, BanditRLProof.Algorithms.MusicalChairsRealized
Declarations
Open an item to read its exact compact statement and source link. Detailed teaching notes are linked when registered.
def
BanditRLProof.MusicalChairs.fixedPlayers
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.fixedPlayersReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def fixedPlayers {n k : ℕ} (s : State n k) : Finset (Fin n)
def
BanditRLProof.MusicalChairs.hitFixed
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.hitFixedReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def hitFixed {n k : ℕ} (s : State n k) (draw : Fin n → Fin k) : Finset (Fin n)
def
BanditRLProof.MusicalChairs.safeFixed
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.safeFixedReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def safeFixed {n k : ℕ} (s : State n k) (draw : Fin n → Fin k) : Finset (Fin n)
theorem
BanditRLProof.MusicalChairs.fixed_action_injective
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.fixed_action_injectiveReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem fixed_action_injective {n k : ℕ} (s : State n k) (draw : Fin n → Fin k) (hs : DistinctFixed s) : Set.InjOn (action s draw) (fixedPlayers s)
theorem
BanditRLProof.MusicalChairs.hitFixed_partner
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.hitFixed_partnerReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem hitFixed_partner {n k : ℕ} (s : State n k) (draw : Fin n → Fin k) (hs : DistinctFixed s) (i : Fin n) (hi : i ∈ hitFixed s draw) : ∃ j, s j = none ∧ action s draw j = action s draw i
theorem
BanditRLProof.MusicalChairs.hitFixed_card_le
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.hitFixed_card_leReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem hitFixed_card_le {n k : ℕ} (s : State n k) (draw : Fin n → Fin k) (hs : DistinctFixed s) : (hitFixed s draw).card ≤ unfixedCount s
theorem
BanditRLProof.MusicalChairs.safeFixed_count
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.safeFixed_countReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem safeFixed_count {n k : ℕ} (s : State n k) (draw : Fin n → Fin k) (hs : DistinctFixed s) : n ≤ (safeFixed s draw).card + 2 * unfixedCount s
def
BanditRLProof.MusicalChairs.roundMeanReward
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.roundMeanRewardReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def roundMeanReward {n k : ℕ} (mu : Fin k → ℝ) (s : State n k) (draw : Fin n → Fin k) : ℝ
def
BanditRLProof.MusicalChairs.roundPseudoRegret
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.roundPseudoRegretReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def roundPseudoRegret {n k : ℕ} (S : Finset (Fin k)) (mu : Fin k → ℝ) (s : State n k) (draw : Fin n → Fin k) : ℝ
theorem
BanditRLProof.MusicalChairs.safeFixed_mem
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.safeFixed_memReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem safeFixed_mem {n k : ℕ} (s : State n k) (draw : Fin n → Fin k) (i : Fin n) (hi : i ∈ safeFixed s draw) : i ∈ fixedPlayers s ∧ CollisionFree (action s draw) i
theorem
BanditRLProof.MusicalChairs.safeFixed_arms_subset
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.safeFixed_arms_subsetReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem safeFixed_arms_subset {n k : ℕ} (S : Finset (Fin k)) (s : State n k) (draw : Fin n → Fin k) (hw : FixedWithin (fun _ => S) s) : (safeFixed s draw).image (action s draw) ⊆ S
theorem
BanditRLProof.MusicalChairs.safeFixed_reward_le
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.safeFixed_reward_leReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem safeFixed_reward_le {n k : ℕ} (mu : Fin k → ℝ) (hmu : ∀ a, 0 ≤ mu a) (s : State n k) (draw : Fin n → Fin k) (hs : DistinctFixed s) : ∑ a ∈ (safeFixed s draw).image (action s draw), mu a ≤ roundMeanReward mu s draw
theorem
BanditRLProof.MusicalChairs.roundPseudoRegret_le_twice_unfixed
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.roundPseudoRegret_le_twice_unfixedReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem roundPseudoRegret_le_twice_unfixed {n k : ℕ} (S : Finset (Fin k)) (hcard : S.card = n) (mu : Fin k → ℝ) (hmu : ∀ a, 0 ≤ mu a ∧ mu a ≤ 1) (s : State n k) (draw : Fin n → Fin k) (hs : DistinctFixed s) (hw : FixedWithin (fun _ => S) s) : roundPseudoRegret S mu s draw ≤ 2 * (unfixedCount s : ℝ)
theorem
BanditRLProof.MusicalChairs.roundPseudoRegret_nonneg
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.roundPseudoRegret_nonnegReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem roundPseudoRegret_nonneg {n k : ℕ} (S : Finset (Fin k)) (mu : Fin k → ℝ) (hmu : ∀ a, 0 ≤ mu a) (s : State n k) (draw : Fin n → Fin k) (hw : FixedWithin (fun _ => S) s) (hd : ∀ i, draw i ∈ S) : 0 ≤ roundPseudoRegret S mu s draw
theorem
BanditRLProof.MusicalChairs.expected_round_charge
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.expected_round_chargeReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem expected_round_charge {n k : ℕ} (S : Finset (Fin k)) (hne : S.Nonempty) (hcard : S.card = n) (mu : Fin k → ℝ) (hmu : ∀ a, 0 ≤ mu a ∧ mu a ≤ 1) (s : State n k) (hs : DistinctFixed s) (hw : FixedWithin (fun _ => S) s) : ∑ draw, (jointDraw (fun _ : Fin n => S) (fun _ => hne)) draw * ENNReal.ofReal (roundPseudoRegret S mu s draw) ≤ 2 * (unfixedCount s : ℝ≥0∞)
def
BanditRLProof.MusicalChairs.expectedCoordinationRegret
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.expectedCoordinationRegretReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def expectedCoordinationRegret {n k : ℕ} (S : Finset (Fin k)) (hne : S.Nonempty) (mu : Fin k → ℝ) (T : ℕ) : ℝ≥0∞
theorem
BanditRLProof.MusicalChairs.expectedCoordinationRegret_le
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.expectedCoordinationRegret_leReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem expectedCoordinationRegret_le {n k : ℕ} (S : Finset (Fin k)) (hne : S.Nonempty) (hcard : S.card = n) (mu : Fin k → ℝ) (hmu : ∀ a, 0 ≤ mu a ∧ mu a ≤ 1) (T : ℕ) : expectedCoordinationRegret (n := n) S hne mu T ≤ 8 * (n : ℝ≥0∞)^2
theorem
BanditRLProof.MusicalChairs.expectedCoordinationRegret_toReal
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.expectedCoordinationRegret_toRealReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem expectedCoordinationRegret_toReal {n k : ℕ} (S : Finset (Fin k)) (hne : S.Nonempty) (mu : Fin k → ℝ) (hmu : ∀ a, 0 ≤ mu a) (T : ℕ) : (expectedCoordinationRegret (n := n) S hne mu T).toReal = ∑ t ∈ Finset.range T, ∑ s, ((stateLaw (fun _ : Fin n => S) (fun _ => hne) t) s).toReal * ∑ draw, ((jointDraw (fun _ : Fin n => S) (fun _ => hne)) draw).toReal * roundPseudoRegret S mu s draw
theorem
BanditRLProof.MusicalChairs.expectedCoordinationRegret_real_le
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Multi-agent bandits
Canonical node identity
declaration:BanditRLProof.MusicalChairs.expectedCoordinationRegret_real_leReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem expectedCoordinationRegret_real_le {n k : ℕ} (S : Finset (Fin k)) (hne : S.Nonempty) (hcard : S.card = n) (mu : Fin k → ℝ) (hmu : ∀ a, 0 ≤ mu a ∧ mu a ≤ 1) (T : ℕ) : (∑ t ∈ Finset.range T, ∑ s, ((stateLaw (fun _ : Fin n => S) (fun _ => hne) t) s).toReal * ∑ draw, ((jointDraw (fun _ : Fin n => S) (fun _ => hne)) draw).toReal * roundPseudoRegret S mu s draw) ≤ 8 * (n : ℝ)^2