pcp_noncompetitive_venue
def
Assumption 2 (non-competitive venue): the least competitive venue has the same publication cost for every type.
Statement
def pcp_noncompetitive_venue {n k : ℕ} (c : Fin n → Fin k → ℝ) : Prop
- Defined in
- The Publication Choice Problem, AAAI 2026 (arXiv:2511.13678v2), Sec. 2-4, Definition 1, Lemma 3.1, Assumptions 1-2, Theorem 4.1 and Conjecture 4.2; formalized by the operator (Claude), 2026-10-04
- Verified
- 03 Oct 2026
- Axioms
- none listed
- Used by 6
- publication_choice_many_type_equilibrium_not_uniqueConjecture 4.2 of arXiv:2511.13678 is false: not every Publication Choice Problem with three strictly ordered types satisfying the…
- publication_choice_binary_equilibrium_not_uniqueTheorem 4.1 of arXiv:2511.13678 is false: not every binary-type Publication Choice Problem satisfying the standing assumptions, Assumption…
- pcx_assumptionsThe binary instance satisfies the standing assumptions with alpha = 1/2, beta = 2, Assumption 1 (MCR) and Assumption 2 (non-competitive…
- publication_choice_three_types_three_equilibriaA Publication Choice Problem with three strictly ordered types and two venues, alpha = 1/2, beta = 2, satisfying Assumptions 1 and 2, has…
- pcy_assumptionsThe three-type instance has strictly increasing types and satisfies the standing assumptions with alpha = 1/2, beta = 2, Assumption 1 and…
- publication_choice_three_equilibriaA binary-type Publication Choice Problem with two venues, alpha = 1/2, beta = 2, satisfying Assumptions 1 and 2, has three pure-strategy…
Lean source view module on GitHub
/-- Assumption 2 (Non-competitive venue) of arXiv:2511.13678: the least competitive venue (index 0) costs the same for every type. -/ def pcp_noncompetitive_venue {n k : ℕ} (c : Fin n → Fin k → ℝ) : Prop := ∀ (i i' : Fin n) (j : Fin k), j.val = 0 → c i j = c i' j