File size: 1,598 Bytes
4a56cd6
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
import OAI.Probability.MatroidSecretary.Labels.FiniteLabelingModel

namespace OAI

namespace MatroidProphet.Labeling

open Finset

/-- A hidden rule on arbitrary finite labels has the same online information
restriction as the canonical `Fin n` hidden rule. -/
structure LabeledHiddenRule (E : Type*) [Fintype E] [MeasurableSpace E]
    (bits : β„•) where
  mask : Seed bits β†’ Finset E
  core : LabeledOnlineRule E bits

noncomputable def labeledObserved {E : Type*} [Fintype E] [MeasurableSpace E]
    {bits : β„•} (A : LabeledHiddenRule E bits) (r : Seed bits) (w : E β†’ ℝ) :
    E β†’ ℝ := by
  classical
  exact fun e => if e ∈ A.mask r then w e else 0

noncomputable def labeledHiddenAcceptedThrough
    {E : Type*} [Fintype E] [MeasurableSpace E] {bits : β„•}
    (A : LabeledHiddenRule E bits) (r : Seed bits) (w : E β†’ ℝ)
    (Ο€ : LabeledOrder E) (t : β„•) : Finset E := by
  classical
  exact labeledAcceptedThrough A.core r (labeledObserved A r w) w Ο€ t \ A.mask r

noncomputable def labeledHiddenReward
    {E : Type*} [Fintype E] [MeasurableSpace E] {bits : β„•}
    (A : LabeledHiddenRule E bits) (r : Seed bits) (w : E β†’ ℝ)
    (Ο€ : LabeledOrder E) : ℝ :=
  βˆ‘ e ∈ labeledHiddenAcceptedThrough A r w Ο€ (Fintype.card E), w e

noncomputable def labeledHiddenWorstReward
    {E : Type*} [Fintype E] [MeasurableSpace E] {bits : β„•}
    (A : LabeledHiddenRule E bits) (w : E β†’ ℝ) (r : Seed bits) : ℝ := by
  classical
  exact Finset.univ.inf' ⟨(Fintype.equivFin E).symm, mem_univ _⟩
    (labeledHiddenReward A r w)

end MatroidProphet.Labeling

end OAI