testing consumer rationality using perfect graphs and
play

Testing Consumer Rationality using Perfect Graphs and Oriented Discs - PowerPoint PPT Presentation

Oct 09, 2023 •164 likes •1.19k views

Testing Consumer Rationality using Perfect Graphs and Oriented Discs Shant Boodaghians and Adrian Vetta McGill University WINE 2015 Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and

  1. Degree of Rationality [Afriat, ‘67] The agent is rational ⇐ ⇒ preference graph is acyclic. We ask: how rational is agent? Definition. An agent’s degree of rationality is the least number of data pairs to ignore for the agent to seem rational. Rational iff DoR = 0. Note 1. This was defined by Houtman and Maks in ‘88. Note 2. Equivalent to Min. Feedback Vertex Set on the Pref. Graph. Example. In the following preference graph, the degree of rationality is 1. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  2. Degree of Rationality [Afriat, ‘67] The agent is rational ⇐ ⇒ preference graph is acyclic. We ask: how rational is agent? Definition. An agent’s degree of rationality is the least number of data pairs to ignore for the agent to seem rational. Rational iff DoR = 0. Note 1. This was defined by Houtman and Maks in ‘88. Note 2. Equivalent to Min. Feedback Vertex Set on the Pref. Graph. Example. In the following preference graph, the degree of rationality is 1. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  3. Degree of Rationality [Afriat, ‘67] The agent is rational ⇐ ⇒ preference graph is acyclic. We ask: how rational is agent? Definition. An agent’s degree of rationality is the least number of data pairs to ignore for the agent to seem rational. Rational iff DoR = 0. Note 1. This was defined by Houtman and Maks in ‘88. Note 2. Equivalent to Min. Feedback Vertex Set on the Pref. Graph. Example. In the following preference graph, the degree of rationality is 1. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  4. Degree of Rationality, Complexity What is the complexity of MFVS in preference graphs? ◮ If market size ( n ) large, then any graph is a preference graph  1 if i = j �  1 if i = j  p i x i j = j = 0 if ( i , j ) ∈ D 0 if i � = j  2 if ( i , j ) / ∈ D  Our Results ◮ Theorem 1. If n = 2, Degree of Rationality is in P. ◮ Theorem 2. If n ≥ 3, DoR decision problem is NP-complete. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  5. Degree of Rationality, Complexity What is the complexity of MFVS in preference graphs? ◮ If market size ( n ) large, then any graph is a preference graph  1 if i = j �  1 if i = j  p i x i j = j = 0 if ( i , j ) ∈ D 0 if i � = j  2 if ( i , j ) / ∈ D  Our Results ◮ Theorem 1. If n = 2, Degree of Rationality is in P. ◮ Theorem 2. If n ≥ 3, DoR decision problem is NP-complete. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  6. Degree of Rationality, Complexity What is the complexity of MFVS in preference graphs? ◮ If market size ( n ) large, then any graph is a preference graph  1 if i = j �  1 if i = j  p i x i j = j = 0 if ( i , j ) ∈ D 0 if i � = j  2 if ( i , j ) / ∈ D  Our Results ◮ Theorem 1. If n = 2, Degree of Rationality is in P. ◮ Theorem 2. If n ≥ 3, DoR decision problem is NP-complete. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  7. Degree of Rationality, Complexity What is the complexity of MFVS in preference graphs? ◮ If market size ( n ) large, then any graph is a preference graph So complexity and approximation complexity same as that of MFVS. ◮ What if n small? Set of attainable graphs is strictly smaller. Approximation complexity likely improves. Our Results ◮ Theorem 1. If n = 2, Degree of Rationality is in P. ◮ Theorem 2. If n ≥ 3, DoR decision problem is NP-complete. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  8. Degree of Rationality, Complexity What is the complexity of MFVS in preference graphs? ◮ If market size ( n ) large, then any graph is a preference graph So complexity and approximation complexity same as that of MFVS. ◮ What if n small? Set of attainable graphs is strictly smaller. Approximation complexity likely improves. Our Results ◮ Theorem 1. If n = 2, Degree of Rationality is in P. ◮ Theorem 2. If n ≥ 3, DoR decision problem is NP-complete. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  9. Degree of Rationality, Complexity What is the complexity of MFVS in preference graphs? ◮ If market size ( n ) large, then any graph is a preference graph So complexity and approximation complexity same as that of MFVS. ◮ What if n small? Set of attainable graphs is strictly smaller. Approximation complexity likely improves. Our Results ◮ Theorem 1. If n = 2, Degree of Rationality is in P. ◮ Theorem 2. If n ≥ 3, DoR decision problem is NP-complete. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  10. Degree of Rationality, Complexity What is the complexity of MFVS in preference graphs? ◮ If market size ( n ) large, then any graph is a preference graph So complexity and approximation complexity same as that of MFVS. ◮ What if n small? Set of attainable graphs is strictly smaller. Approximation complexity likely improves. Our Results ◮ Theorem 1. If n = 2, Degree of Rationality is in P. ◮ Theorem 2. If n ≥ 3, DoR decision problem is NP-complete. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  11. 2-Commodity Markets Theorem 1. Degree of rationality is poly-time for n = 2. Proof Sketch. 1. [Rose, ‘58] : If n = 2, every cycle contains a digon (2-cycle) 2. Corollary. MFVS is Min. Vertex Cover on the set of digons 3. Lemma. Digon graphs of pref. graphs are perfect for n = 2. (New class of perfect graphs?) 4. [GLS, ‘84] : Min Vertex Cover on a Perfect Graph is polytime. So Theorem 1. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  12. 2-Commodity Markets Theorem 1. Degree of rationality is poly-time for n = 2. Proof Sketch. 1. [Rose, ‘58] : If n = 2, every cycle contains a digon (2-cycle) 2. Corollary. MFVS is Min. Vertex Cover on the set of digons 3. Lemma. Digon graphs of pref. graphs are perfect for n = 2. (New class of perfect graphs?) 4. [GLS, ‘84] : Min Vertex Cover on a Perfect Graph is polytime. So Theorem 1. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  13. 2-Commodity Markets Theorem 1. Degree of rationality is poly-time for n = 2. Proof Sketch. 1. [Rose, ‘58] : If n = 2, every cycle contains a digon (2-cycle) 2. Corollary. MFVS is Min. Vertex Cover on the set of digons 3. Lemma. Digon graphs of pref. graphs are perfect for n = 2. (New class of perfect graphs?) 4. [GLS, ‘84] : Min Vertex Cover on a Perfect Graph is polytime. So Theorem 1. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  14. 2-Commodity Markets Theorem 1. Degree of rationality is poly-time for n = 2. Proof Sketch. 1. [Rose, ‘58] : If n = 2, every cycle contains a digon (2-cycle) 2. Corollary. MFVS is Min. Vertex Cover on the set of digons 3. Lemma. Digon graphs of pref. graphs are perfect for n = 2. (New class of perfect graphs?) 4. [GLS, ‘84] : Min Vertex Cover on a Perfect Graph is polytime. So Theorem 1. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  15. 2-Commodity Markets Theorem 1. Degree of rationality is poly-time for n = 2. Proof Sketch. 1. [Rose, ‘58] : If n = 2, every cycle contains a digon (2-cycle) 2. Corollary. MFVS is Min. Vertex Cover on the set of digons 3. Lemma. Digon graphs of pref. graphs are perfect for n = 2. (New class of perfect graphs?) 4. [GLS, ‘84] : Min Vertex Cover on a Perfect Graph is polytime. So Theorem 1. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  16. 2-Commodity Markets Theorem 1. Degree of rationality is poly-time for n = 2. Proof Sketch. 1. [Rose, ‘58] : If n = 2, every cycle contains a digon (2-cycle) 2. Corollary. MFVS is Min. Vertex Cover on the set of digons 3. Lemma. Digon graphs of pref. graphs are perfect for n = 2. (New class of perfect graphs?) 4. [GLS, ‘84] : Min Vertex Cover on a Perfect Graph is polytime. So Theorem 1. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  17. 2-Commodity Markets Theorem 1. Degree of rationality is poly-time for n = 2. Proof Sketch. 1. [Rose, ‘58] : If n = 2, every cycle contains a digon (2-cycle) 2. Corollary. MFVS is Min. Vertex Cover on the set of digons 3. Lemma. Digon graphs of pref. graphs are perfect for n = 2. (New class of perfect graphs?) 4. [GLS, ‘84] : Min Vertex Cover on a Perfect Graph is polytime. So Theorem 1. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  18. The digon graph [Rose, ‘58] : If n = 2, every cycle contains the vertex set of a digon. Therefore, hitting every digon hits every cycle. Definition. The digon graph of a directed graph D = ( V , A ) is G = ( V , E ), where E is exactly the set of digons in D . Example. Corollary. Degree of Rationality reduces to Min. Vertex Cover on G . Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  19. The digon graph [Rose, ‘58] : If n = 2, every cycle contains the vertex set of a digon. Therefore, hitting every digon hits every cycle. Definition. The digon graph of a directed graph D = ( V , A ) is G = ( V , E ), where E is exactly the set of digons in D . Example. Corollary. Degree of Rationality reduces to Min. Vertex Cover on G . Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  20. The digon graph [Rose, ‘58] : If n = 2, every cycle contains the vertex set of a digon. Therefore, hitting every digon hits every cycle. Definition. The digon graph of a directed graph D = ( V , A ) is G = ( V , E ), where E is exactly the set of digons in D . Example. Corollary. Degree of Rationality reduces to Min. Vertex Cover on G . Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  21. The digon graph [Rose, ‘58] : If n = 2, every cycle contains the vertex set of a digon. Therefore, hitting every digon hits every cycle. Definition. The digon graph of a directed graph D = ( V , A ) is G = ( V , E ), where E is exactly the set of digons in D . Example. Corollary. Degree of Rationality reduces to Min. Vertex Cover on G . Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  22. The digon graph [Rose, ‘58] : If n = 2, every cycle contains the vertex set of a digon. Therefore, hitting every digon hits every cycle. Definition. The digon graph of a directed graph D = ( V , A ) is G = ( V , E ), where E is exactly the set of digons in D . Example. Corollary. Degree of Rationality reduces to Min. Vertex Cover on G . Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  23. The digon graph [Rose, ‘58] : If n = 2, every cycle contains the vertex set of a digon. Therefore, hitting every digon hits every cycle. Definition. The digon graph of a directed graph D = ( V , A ) is G = ( V , E ), where E is exactly the set of digons in D . Example. Corollary. Degree of Rationality reduces to Min. Vertex Cover on G . Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  24. Examples of Digon Graphs Which graphs can be constructed as digon graphs? Some examples Complete r -part. Complete Bip. Graphs, Complete Graphs, Graphs, ◮ Complements of complete r -partite graphs, ◮ Many small graphs, ◮ etc. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  25. Examples of Digon Graphs Which graphs can be constructed as digon graphs? Some examples Complete r -part. Complete Bip. Graphs, Complete Graphs, Graphs, ◮ Complements of complete r -partite graphs, ◮ Many small graphs, ◮ etc. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  26. Examples of Digon Graphs Which graphs can be constructed as digon graphs? Some examples Complete r -part. Complete Bip. Graphs, Complete Graphs, Graphs, ◮ Complements of complete r -partite graphs, ◮ Many small graphs, ◮ etc. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  27. Examples of Digon Graphs Which graphs can be constructed as digon graphs? Some examples Complete r -part. Complete Bip. Graphs, Complete Graphs, Graphs, ◮ Complements of complete r -partite graphs, ◮ Many small graphs, ◮ etc. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  28. Examples of Digon Graphs Which graphs can be constructed as digon graphs? Some examples Complete r -part. Complete Bip. Graphs, Complete Graphs, Graphs, ◮ Complements of complete r -partite graphs, ◮ Many small graphs, ◮ etc. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  29. Digon Graphs of Pref. Graphs are Perfect when n = 2 Sub-Lemma. If x ≶ y , x ≶ z and y � ≶ z , then either x y z y or not y x z z x Proof : Suppose not, y y x x z z Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  30. Digon Graphs of Pref. Graphs are Perfect when n = 2 Sub-Lemma. If x ≶ y , x ≶ z and y � ≶ z , then either x y z y or not y x z z x Proof : Suppose not, y y x x z z Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  31. Digon Graphs of Pref. Graphs are Perfect when n = 2 Sub-Lemma. If x ≶ y , x ≶ z and y � ≶ z , then either x y z y or not y x z z x Proof : Suppose not, y y x x z z Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  32. Digon Graphs of Pref. Graphs are Perfect when n = 2 Sub-Lemma. If x ≶ y , x ≶ z and y � ≶ z , then either x y z y or not y x z z x Proof : Suppose not, y y x x z z Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  33. Digon Graphs of Pref. Graphs are Perfect when n = 2 Sub-Lemma. If x ≶ y , x ≶ z and y � ≶ z , then either x y z y or not y x z z x Proof : Suppose not, y y x x z z Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  34. Corollary. Long paths “alternate” in the digon graph Corollary. 1. The digon graph contains no odd holes on ≥ 5 vertices. 2. The digon graph contains no antiholes on ≥ 5 vertices. [CRST, ‘06] Strong Perfect Graph Theorem A graph is perfect ⇐ ⇒ contains no odd holes and no odd antiholes. Corollary. Digon Graphs of Pref. Graphs are perfect when n = 2. “So Theorem 1. follows as a corollary.” Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  35. Corollary. Long paths “alternate” in the digon graph Corollary. 1. The digon graph contains no odd holes on ≥ 5 vertices. 2. The digon graph contains no antiholes on ≥ 5 vertices. [CRST, ‘06] Strong Perfect Graph Theorem A graph is perfect ⇐ ⇒ contains no odd holes and no odd antiholes. Corollary. Digon Graphs of Pref. Graphs are perfect when n = 2. “So Theorem 1. follows as a corollary.” Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  36. Corollary. Long paths “alternate” in the digon graph Corollary. 1. The digon graph contains no odd holes on ≥ 5 vertices. 2. The digon graph contains no antiholes on ≥ 5 vertices. [CRST, ‘06] Strong Perfect Graph Theorem A graph is perfect ⇐ ⇒ contains no odd holes and no odd antiholes. Corollary. Digon Graphs of Pref. Graphs are perfect when n = 2. “So Theorem 1. follows as a corollary.” Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  37. Corollary. Long paths “alternate” in the digon graph Corollary. 1. The digon graph contains no odd holes on ≥ 5 vertices. 2. The digon graph contains no antiholes on ≥ 5 vertices. [CRST, ‘06] Strong Perfect Graph Theorem A graph is perfect ⇐ ⇒ contains no odd holes and no odd antiholes. Corollary. Digon Graphs of Pref. Graphs are perfect when n = 2. “So Theorem 1. follows as a corollary.” Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  38. Corollary. Long paths “alternate” in the digon graph Corollary. 1. The digon graph contains no odd holes on ≥ 5 vertices. 2. The digon graph contains no antiholes on ≥ 5 vertices. [CRST, ‘06] Strong Perfect Graph Theorem A graph is perfect ⇐ ⇒ contains no odd holes and no odd antiholes. Corollary. Digon Graphs of Pref. Graphs are perfect when n = 2. “So Theorem 1. follows as a corollary.” Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  39. Digon Graphs as a Class of Perfect Graphs Open problem: Characterize the class of digon graphs of pref. graphs for n = 2. We know: ◮ DG � ≶ Complements of bipartite graphs ◮ DG � ≶ Complements of line gr. of bipartite graphs ◮ DG �⊂ Bipartite graphs ◮ DG �⊂ Line gr. of bipartite graphs And maybe DG � Comparability graphs Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  40. 3-Commodity Markets Theorem 2. The decision problem is NP-complete for n ≥ 3. Proof Sketch. 1. [WK, ‘88] : Reduce planar 3-SAT to vert. cover on “gadget graphs” 2. Remark. Can reduce vert. cover to MFVS on a graph of digons. 3. Lemma. This graph of digons is an “oriented-disk graph” 4. Lemma. Any ODG is a valid preference graph for n = 3. So Theorem 2. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  41. 3-Commodity Markets Theorem 2. The decision problem is NP-complete for n ≥ 3. Proof Sketch. 1. [WK, ‘88] : Reduce planar 3-SAT to vert. cover on “gadget graphs” 2. Remark. Can reduce vert. cover to MFVS on a graph of digons. 3. Lemma. This graph of digons is an “oriented-disk graph” 4. Lemma. Any ODG is a valid preference graph for n = 3. So Theorem 2. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  42. 3-Commodity Markets Theorem 2. The decision problem is NP-complete for n ≥ 3. Proof Sketch. 1. [WK, ‘88] : Reduce planar 3-SAT to vert. cover on “gadget graphs” 2. Remark. Can reduce vert. cover to MFVS on a graph of digons. 3. Lemma. This graph of digons is an “oriented-disk graph” 4. Lemma. Any ODG is a valid preference graph for n = 3. So Theorem 2. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  43. 3-Commodity Markets Theorem 2. The decision problem is NP-complete for n ≥ 3. Proof Sketch. 1. [WK, ‘88] : Reduce planar 3-SAT to vert. cover on “gadget graphs” 2. Remark. Can reduce vert. cover to MFVS on a graph of digons. 3. Lemma. This graph of digons is an “oriented-disk graph” 4. Lemma. Any ODG is a valid preference graph for n = 3. So Theorem 2. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  44. 3-Commodity Markets Theorem 2. The decision problem is NP-complete for n ≥ 3. Proof Sketch. 1. [WK, ‘88] : Reduce planar 3-SAT to vert. cover on “gadget graphs” 2. Remark. Can reduce vert. cover to MFVS on a graph of digons. 3. Lemma. This graph of digons is an “oriented-disk graph” 4. Lemma. Any ODG is a valid preference graph for n = 3. So Theorem 2. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  45. 3-Commodity Markets Theorem 2. The decision problem is NP-complete for n ≥ 3. Proof Sketch. 1. [WK, ‘88] : Reduce planar 3-SAT to vert. cover on “gadget graphs” 2. Remark. Can reduce vert. cover to MFVS on a graph of digons. 3. Lemma. This graph of digons is an “oriented-disk graph” 4. Lemma. Any ODG is a valid preference graph for n = 3. So Theorem 2. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  46. [WK, ‘88] : Reduce planar 3-SAT to vertex cover on “gadget graphs”: ◮ Add a triangle per clause, labelled with variable type ◮ Add a cycle per variable, alternating labels ◮ Connect each clause to the cycles, opposite label. Example. Graph for ϕ = (¯ u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ ¯ u 2 ∨ u 3 ) u 1 u 1 ¯ . . . u 1 gadget ¯ u 1 u 1 . . . C 1 gadget C 2 gadget ¯ . . . u 1 u 1 u 2 ¯ ¯ u 2 u 2 u 2 u 2 gadget . . . u 3 u 3 . . . u 3 u 3 gadget u 3 . . . ¯ u 3 Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  47. [WK, ‘88] : Reduce planar 3-SAT to vertex cover on “gadget graphs”: ◮ Add a triangle per clause, labelled with variable type ◮ Add a cycle per variable, alternating labels ◮ Connect each clause to the cycles, opposite label. Example. Graph for ϕ = (¯ u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ ¯ u 2 ∨ u 3 ) u 1 u 1 ¯ . . . u 1 gadget ¯ u 1 u 1 . . . C 1 gadget C 2 gadget ¯ . . . u 1 u 1 u 2 ¯ ¯ u 2 u 2 u 2 u 2 gadget . . . u 3 u 3 . . . u 3 u 3 gadget u 3 . . . ¯ u 3 Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  48. [WK, ‘88] : Reduce planar 3-SAT to vertex cover on “gadget graphs”: ◮ Add a triangle per clause, labelled with variable type ◮ Add a cycle per variable, alternating labels ◮ Connect each clause to the cycles, opposite label. Example. Graph for ϕ = (¯ u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ ¯ u 2 ∨ u 3 ) u 1 u 1 ¯ . . . u 1 gadget ¯ u 1 u 1 . . . C 1 gadget C 2 gadget ¯ . . . u 1 u 1 u 2 ¯ ¯ u 2 u 2 u 2 u 2 gadget . . . u 3 u 3 . . . u 3 u 3 gadget u 3 . . . ¯ u 3 Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  49. [WK, ‘88] : Reduce planar 3-SAT to vertex cover on “gadget graphs”: ◮ Add a triangle per clause, labelled with variable type ◮ Add a cycle per variable, alternating labels ◮ Connect each clause to the cycles, opposite label. Example. Graph for ϕ = (¯ u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ ¯ u 2 ∨ u 3 ) u 1 u 1 ¯ . . . u 1 gadget ¯ u 1 u 1 . . . C 1 gadget C 2 gadget ¯ . . . u 1 u 1 u 2 ¯ ¯ u 2 u 2 u 2 u 2 gadget . . . u 3 u 3 . . . u 3 u 3 gadget u 3 . . . ¯ u 3 Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  50. [WK, ‘88] : Reduce planar 3-SAT to vertex cover on “gadget graphs”: ◮ Add a triangle per clause, labelled with variable type ◮ Add a cycle per variable, alternating labels ◮ Connect each clause to the cycles, opposite label. Example. Graph for ϕ = (¯ u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ ¯ u 2 ∨ u 3 ) u 1 u 1 ¯ . . . u 1 gadget ¯ u 1 u 1 . . . C 1 gadget C 2 gadget ¯ . . . u 1 u 1 u 2 ¯ ¯ u 2 u 2 u 2 u 2 gadget . . . u 3 u 3 . . . u 3 u 3 gadget u 3 . . . ¯ u 3 Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  51. Reduction To Vertex Cover ... ... ... ... ... ... Note. Have a lower bound on vertex cover: ◮ Every clause needs at least 2 vertices to cover ◮ Every cycle needs at least half [WK,‘88] This bound is attainable if and only if the expression is satisfiable. = ⇒ 3-SAT reduces to Vertex Cover on these graphs. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  52. Reduction To Vertex Cover ... ... ... ... ... ... Note. Have a lower bound on vertex cover: ◮ Every clause needs at least 2 vertices to cover ◮ Every cycle needs at least half [WK,‘88] This bound is attainable if and only if the expression is satisfiable. = ⇒ 3-SAT reduces to Vertex Cover on these graphs. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  53. 3-Commodity Markets Theorem 2. The decision problem is NP-complete for n ≥ 3. Proof Sketch. 1. [WK, ‘88] : Reduce planar 3-SAT to vert. cover on “gadget graphs” 2. Remark. Can reduce vert. cover to MFVS on a graph of digons. 3. Lemma. This graph of digons is an “oriented-disk graph” 4. Lemma. Any ODG is a valid preference graph for n = 3. So Theorem 2. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  54. Oriented Disk Graphs Definition. Let x 1 , . . . , x n be points on the plane, and D 1 , . . . D n be disks such that x i is on D i ’s boundary. Add an arc from x i to x j if x j ∈ D i . Any such graph is an oriented-disk graph. Example. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  55. Oriented Disk Graphs Definition. Let x 1 , . . . , x n be points on the plane, and D 1 , . . . D n be disks such that x i is on D i ’s boundary. Add an arc from x i to x j if x j ∈ D i . Any such graph is an oriented-disk graph. Example. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  56. Oriented Disk Graphs Definition. Let x 1 , . . . , x n be points on the plane, and D 1 , . . . D n be disks such that x i is on D i ’s boundary. Add an arc from x i to x j if x j ∈ D i . Any such graph is an oriented-disk graph. Example. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  57. Oriented Disk Graphs Definition. Let x 1 , . . . , x n be points on the plane, and D 1 , . . . D n be disks such that x i is on D i ’s boundary. Add an arc from x i to x j if x j ∈ D i . Any such graph is an oriented-disk graph. Example. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  58. Oriented Disk Graphs Definition. Let x 1 , . . . , x n be points on the plane, and D 1 , . . . D n be disks such that x i is on D i ’s boundary. Add an arc from x i to x j if x j ∈ D i . Any such graph is an oriented-disk graph. Example. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  59. Vertex Cover Reduces to FVS on a Digon Graph Remark. ◮ Take any undirected graph, and replace each edge with a digon. ◮ Add an arbitrary acyclic set of arcs. ◮ Min. Vertex Cover on the underlying graph is equivalent to MFVS on this digraph. (Any new cycle passes through a digon) Claim. There exists an oriented-disk graph which is a graph of digons for the gadget graph, plus an acyclic set of edges. This would give a reduction from planar 3-SAT to MFVS on ODG’s. Clause Gadgets, Long Paths and Cycles Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  60. Vertex Cover Reduces to FVS on a Digon Graph Remark. ◮ Take any undirected graph, and replace each edge with a digon. ◮ Add an arbitrary acyclic set of arcs. ◮ Min. Vertex Cover on the underlying graph is equivalent to MFVS on this digraph. (Any new cycle passes through a digon) Claim. There exists an oriented-disk graph which is a graph of digons for the gadget graph, plus an acyclic set of edges. This would give a reduction from planar 3-SAT to MFVS on ODG’s. Clause Gadgets, Long Paths and Cycles Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  61. Vertex Cover Reduces to FVS on a Digon Graph Remark. ◮ Take any undirected graph, and replace each edge with a digon. ◮ Add an arbitrary acyclic set of arcs. ◮ Min. Vertex Cover on the underlying graph is equivalent to MFVS on this digraph. (Any new cycle passes through a digon) Claim. There exists an oriented-disk graph which is a graph of digons for the gadget graph, plus an acyclic set of edges. This would give a reduction from planar 3-SAT to MFVS on ODG’s. Clause Gadgets, Long Paths and Cycles Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  62. Vertex Cover Reduces to FVS on a Digon Graph Remark. ◮ Take any undirected graph, and replace each edge with a digon. ◮ Add an arbitrary acyclic set of arcs. ◮ Min. Vertex Cover on the underlying graph is equivalent to MFVS on this digraph. (Any new cycle passes through a digon) Claim. There exists an oriented-disk graph which is a graph of digons for the gadget graph, plus an acyclic set of edges. This would give a reduction from planar 3-SAT to MFVS on ODG’s. Clause Gadgets, Long Paths and Cycles Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  63. Vertex Cover Reduces to FVS on a Digon Graph Remark. ◮ Take any undirected graph, and replace each edge with a digon. ◮ Add an arbitrary acyclic set of arcs. ◮ Min. Vertex Cover on the underlying graph is equivalent to MFVS on this digraph. (Any new cycle passes through a digon) Claim. There exists an oriented-disk graph which is a graph of digons for the gadget graph, plus an acyclic set of edges. This would give a reduction from planar 3-SAT to MFVS on ODG’s. Clause Gadgets, Long Paths and Cycles Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  64. The Gadget Graph is Planar What does this oriented-disk drawing look like? 1. Take a planar drawing of the variable-clause graph. 2. Replace the clause vertices with clause gadgets. ∗ 3. Trace around the edges incident to each variable with its cycle. 4. ∗ How do we connect the cycles to the clause gadgets? C 1 u 3 u 1 u 2 u 4 C 2 C 3 E.g. ϕ = ( u 1 ∨ u 2 ∨ u 4 ) ∧ ( u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ u 3 ∨ u 4 ) Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  65. The Gadget Graph is Planar What does this oriented-disk drawing look like? 1. Take a planar drawing of the variable-clause graph. 2. Replace the clause vertices with clause gadgets. ∗ 3. Trace around the edges incident to each variable with its cycle. 4. ∗ How do we connect the cycles to the clause gadgets? C 1 u 3 u 1 u 2 u 4 C 2 C 3 E.g. ϕ = ( u 1 ∨ u 2 ∨ u 4 ) ∧ ( u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ u 3 ∨ u 4 ) Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  66. The Gadget Graph is Planar What does this oriented-disk drawing look like? 1. Take a planar drawing of the variable-clause graph. 2. Replace the clause vertices with clause gadgets. ∗ 3. Trace around the edges incident to each variable with its cycle. 4. ∗ How do we connect the cycles to the clause gadgets? C 1 u 3 u 1 u 2 u 4 C 3 C 2 E.g. ϕ = ( u 1 ∨ u 2 ∨ u 4 ) ∧ ( u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ u 3 ∨ u 4 ) Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  67. The Gadget Graph is Planar What does this oriented-disk drawing look like? 1. Take a planar drawing of the variable-clause graph. 2. Replace the clause vertices with clause gadgets. ∗ 3. Trace around the edges incident to each variable with its cycle. 4. ∗ How do we connect the cycles to the clause gadgets? C 1 u 3 u 1 u 2 u 4 C 3 C 2 E.g. ϕ = ( u 1 ∨ u 2 ∨ u 4 ) ∧ ( u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ u 3 ∨ u 4 ) Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  68. The Gadget Graph is Planar What does this oriented-disk drawing look like? 1. Take a planar drawing of the variable-clause graph. 2. Replace the clause vertices with clause gadgets. ∗ 3. Trace around the edges incident to each variable with its cycle. 4. ∗ How do we connect the cycles to the clause gadgets? C 1 u 3 u 1 u 2 u 4 C 3 C 2 E.g. ϕ = ( u 1 ∨ u 2 ∨ u 4 ) ∧ ( u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ u 3 ∨ u 4 ) Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  69. The Gadget Graph is Planar What does this oriented-disk drawing look like? 1. Take a planar drawing of the variable-clause graph. 2. Replace the clause vertices with clause gadgets. ∗ 3. Trace around the edges incident to each variable with its cycle. 4. ∗ How do we connect the cycles to the clause gadgets? C 1 u 3 u 1 u 2 u 4 C 3 C 2 E.g. ϕ = ( u 1 ∨ u 2 ∨ u 4 ) ∧ ( u 1 ∨ u 2 ∨ u 3 ) ∧ ( u 1 ∨ u 3 ∨ u 4 ) Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  70. Clause Gadget to Cycle Connection Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  71. Clause Gadget to Cycle Connection Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  72. 3-Commodity Markets Theorem 2. The decision problem is NP-complete for n ≥ 3. Proof Sketch. 1. [WK, ‘88] : Reduce planar 3-SAT to vert. cover on “gadget graphs” 2. Remark. Can reduce vert. cover to MFVS on a graph of digons. 3. Lemma. This graph of digons is an “oriented-disk graph” 4. Lemma. Any ODG is a valid preference graph for n = 3. So Theorem 2. follows as a corollary. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  73. Lemma. Oriented-disk graphs are valid preference graphs for n = 3. Can map any planar drawing onto a small sphere section Map points onto sphere, cut through sphere with plane to get disks (Price vector is plane normal) Vertex revealed preferred to any point inside disk So any ODG is a preference graph, and “ Theorem 2. follows as a corollary.” Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  74. Lemma. Oriented-disk graphs are valid preference graphs for n = 3. Can map any planar drawing onto a small sphere section Map points onto sphere, cut through sphere with plane to get disks (Price vector is plane normal) Vertex revealed preferred to any point inside disk So any ODG is a preference graph, and “ Theorem 2. follows as a corollary.” Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  75. Lemma. Oriented-disk graphs are valid preference graphs for n = 3. Can map any planar drawing onto a small sphere section Map points onto sphere, cut through sphere with plane to get disks (Price vector is plane normal) Vertex revealed preferred to any point inside disk So any ODG is a preference graph, and “ Theorem 2. follows as a corollary.” Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  76. Lemma. Oriented-disk graphs are valid preference graphs for n = 3. Can map any planar drawing onto a small sphere section Map points onto sphere, cut through sphere with plane to get disks (Price vector is plane normal) Vertex revealed preferred to any point inside disk So any ODG is a preference graph, and “ Theorem 2. follows as a corollary.” Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  77. Further Research We have shown that n = 2 is the threshold for poly-time solvability ◮ What about approximation complexity? ◮ Can we provide combinatorial algorithm for n = 2? ◮ Can we characterise preference graphs for fixed n ? ◮ Does bounding DoR affect welfare in a combinatorial auction? (RP constraints are used to impose truthfulness.) Thank you. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  78. Further Research We have shown that n = 2 is the threshold for poly-time solvability ◮ What about approximation complexity? ◮ Can we provide combinatorial algorithm for n = 2? ◮ Can we characterise preference graphs for fixed n ? ◮ Does bounding DoR affect welfare in a combinatorial auction? (RP constraints are used to impose truthfulness.) Thank you. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  79. Further Research We have shown that n = 2 is the threshold for poly-time solvability ◮ What about approximation complexity? ◮ Can we provide combinatorial algorithm for n = 2? ◮ Can we characterise preference graphs for fixed n ? ◮ Does bounding DoR affect welfare in a combinatorial auction? (RP constraints are used to impose truthfulness.) Thank you. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

  80. Further Research We have shown that n = 2 is the threshold for poly-time solvability ◮ What about approximation complexity? ◮ Can we provide combinatorial algorithm for n = 2? ◮ Can we characterise preference graphs for fixed n ? ◮ Does bounding DoR affect welfare in a combinatorial auction? (RP constraints are used to impose truthfulness.) Thank you. Shant Boodaghians and Adrian Vetta McGill University Testing Consumer Rationality using Perfect Graphs and Oriented Discs

Recommend

Direct to Consumer Testing (DTC) Power and Pitfalls What is DTC Testing? Direct to Consumer

Direct to Consumer Testing (DTC) Power and Pitfalls What is DTC Testing? Direct to Consumer

Direct to Consumer Testing (DTC) Power and Pitfalls What is DTC Testing? Direct to Consumer (DTC) genetic tests are advertised and sold directly to the u public. Offers information that many include ancestry, risks of developing certain u

666 views • 17 slides
MAP Estimation with Perfect Graphs Tony Jebara July 21, 2009 Background Matchings Perfect

MAP Estimation with Perfect Graphs Tony Jebara July 21, 2009 Background Matchings Perfect

Background Matchings Perfect Graphs MAP Estimation MAP Estimation with Perfect Graphs Tony Jebara July 21, 2009 Background Matchings Perfect Graphs MAP Estimation Background 1 Perfect Graphs Graphical Models Matchings 2 Bipartite

713 views • 46 slides
On minimum weight clique cover problem of claw-free perfect graphs Flavia Bonomo 1 Gianpaolo

On minimum weight clique cover problem of claw-free perfect graphs Flavia Bonomo 1 Gianpaolo

MWSS and MWCC MSS and MCC on claw-free perfect graphs MWCC on strip composed perfect graphs On minimum weight clique cover problem of claw-free perfect graphs Flavia Bonomo 1 Gianpaolo Oriolo 2 Claudia Snels 2 1 Universit` a di Buenos Aires 2

677 views • 40 slides
MAP Estimation, Message Passing and Perfect Graphs Tony Jebara November 25, 2009 Background

MAP Estimation, Message Passing and Perfect Graphs Tony Jebara November 25, 2009 Background

Background Matchings Perfect Graphs MAP Estimation MAP Estimation, Message Passing and Perfect Graphs Tony Jebara November 25, 2009 Background Matchings Perfect Graphs MAP Estimation Background 1 Perfect Graphs Graphical Models

557 views • 42 slides
Counting perfect matchings in planar graphs With the FKT algorithm FKT Algorithm by PlusOne 1

Counting perfect matchings in planar graphs With the FKT algorithm FKT Algorithm by PlusOne 1

Counting perfect matchings in planar graphs With the FKT algorithm FKT Algorithm by PlusOne 1 Def Perfect Matching Z Given a graph G = (V,E), a matching M in G is a set of pairwise non-adjacent edges. M is said to be perfect if every vertex

424 views • 24 slides
Characterization for perfect matchings Often we are interested in perfect matchings. X Y 1 5

Characterization for perfect matchings Often we are interested in perfect matchings. X Y 1 5

15-251 Great Ideas in Theoretical Computer Science Lecture 14: Graphs IV: Stable Matchings October 12th, 2017 Halls Theorem Characterization for perfect matchings Often we are interested in perfect matchings. X Y 1 5 2 6 3 7 4

285 views • 10 slides
Planarity Testing of Graphs Swami Sarvottamananda Ramakrishna Mission Vivekananda University

Planarity Testing of Graphs Swami Sarvottamananda Ramakrishna Mission Vivekananda University

Planarity Testing of Graphs Planarity Testing of Graphs Swami Sarvottamananda Ramakrishna Mission Vivekananda University NITPatna-IGGA, 2011 Planarity Testing of Graphs Outline I Introduction 1 Scope of the Lecture Motivation for Planar

1.18k views • 92 slides
Disclosures Disclosures Disclosures Disclosures Genetic counsellors employed by PCRM 2

Disclosures Disclosures Disclosures Disclosures Genetic counsellors employed by PCRM 2

6/24/2019 CONSUMER CONSUMER CONSUMER CONSUMER- - - -DIRECTED GENETIC TESTING DIRECTED GENETIC TESTING DIRECTED GENETIC TESTING DIRECTED GENETIC TESTING WHAT WHAT IT MEANS FOR MY PATIENT AND MY PRACTICE WHAT WHAT IT

659 views • 23 slides
Perfect 1-Factorisations of Cubic Graphs Rosie Hoyte Honours project at The University of

Perfect 1-Factorisations of Cubic Graphs Rosie Hoyte Honours project at The University of

Perfect 1-Factorisations of Cubic Graphs Rosie Hoyte Honours project at The University of Queensland Supervisor: Dr Barbara Maenhaut Outline Definitions and background The complete graph Cubic graphs o General results o Small

398 views • 25 slides
NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum

NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum

NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs David Eppstein and Vijay V. Vazirani University of California, Irvine Symposium on Parallel Algorithms, June

861 views • 19 slides
Testing the rationality of categorical predictions Carlos Madeira Central Bank of Chile May,

Testing the rationality of categorical predictions Carlos Madeira Central Bank of Chile May,

Testing the rationality of categorical predictions Carlos Madeira Central Bank of Chile May, 2017 Carlos Madeira (Central Bank of Chile) Rationality of categorical predictions May, 2017 1 / 18 Introduction Data on subjective expectations is

455 views • 18 slides
Testing Java Microservices with Consumer-driven contracts Andrew Morgan @mogronalol

Testing Java Microservices with Consumer-driven contracts Andrew Morgan @mogronalol

Testing Java Microservices with Consumer-driven contracts Andrew Morgan @mogronalol Microservices testing is hard Consumer driven contract testing About Me Independent Consultant specialising in microservices & continuous delivery

1.54k views • 75 slides
Counting perfect matchings of cubic graphs in the geometric dual Marcos Kiwi University of Chile

Counting perfect matchings of cubic graphs in the geometric dual Marcos Kiwi University of Chile

Introduction Our approach (planar graphs case) & Main results Proof ideas Non-planar case Counting perfect matchings of cubic graphs in the geometric dual Marcos Kiwi University of Chile Joint work with: Andrea Jim enez (U. Chile)

367 views • 36 slides
Revisiting the Limits of MAP Inference by MWSS on Perfect Graphs Adrian Weller University of

Revisiting the Limits of MAP Inference by MWSS on Perfect Graphs Adrian Weller University of

Revisiting the Limits of MAP Inference by MWSS on Perfect Graphs Adrian Weller University of Cambridge CP 2015 Cork, Ireland Slides and full paper at http://mlg.eng.cam.ac.uk/adrian/ 1 / 21 Motivation: undirected graphical models (MRFs)

594 views • 27 slides
Rationality Decision Behavior: Theory and Evidence Todd Davies A Framework for Rationality A

Rationality Decision Behavior: Theory and Evidence Todd Davies A Framework for Rationality A

Rationality Decision Behavior: Theory and Evidence Todd Davies A Framework for Rationality A context C with 4 attributes: 1. Actions. A set (one or more) of moves executed in C . 2. Constraints. A set of characteristics that apply in (i.e.

349 views • 12 slides
EconS 424 - Strategy and Game Theory Why do we need Perfect Bayesian equilibrium? Asking for

EconS 424 - Strategy and Game Theory Why do we need Perfect Bayesian equilibrium? Asking for

EconS 424 - Strategy and Game Theory Why do we need Perfect Bayesian equilibrium? Asking for sequential rationality in sequential-move games with incomplete information March 28, 2013 1 Motivating example Let us consider the following

117 views • 9 slides
Counting Perfect Matchings In Graphs with Application in monomer dimer models Afshin Behmaram

Counting Perfect Matchings In Graphs with Application in monomer dimer models Afshin Behmaram

Counting Perfect Matchings In Graphs with Application in monomer dimer models Afshin Behmaram University of Tabriz, Tabriz , Iran Definition Let G be simple graph. A matching M in G is the set of pair wise non adjacent edges , that is

499 views • 18 slides
Rationality and Traffic Attraction Rationality and Traffic Attraction Incentives for Honest Path

Rationality and Traffic Attraction Rationality and Traffic Attraction Incentives for Honest Path

Rationality and Traffic Attraction Rationality and Traffic Attraction Incentives for Honest Path Announcement in BGP Princeton AT&T AT&T $ IBM Local Local ISP ISP ISP ISP Comcast Sharon Goldberg Shai Halevi Aaron D. Jaggard

735 views • 47 slides
Perfect 1-Factorisations of Circulant Graphs of Degree 4 Sarada Herke PhD Supervisor: Dr.

Perfect 1-Factorisations of Circulant Graphs of Degree 4 Sarada Herke PhD Supervisor: Dr.

Perfect 1-Factorisations of Circulant Graphs of Degree 4 Sarada Herke PhD Supervisor: Dr. Barbara Maenhaut The University of Queensland June 2013 Sarada Herke (UQ) P1Fs of Circulants June 2013 1 / 18 Outline definitions and history what

982 views • 71 slides
From Bayesian Nash Equilibrium (BNE) to Perfect Bayesian Equilibrium (PBE) Flix Muoz-Garca

From Bayesian Nash Equilibrium (BNE) to Perfect Bayesian Equilibrium (PBE) Flix Muoz-Garca

From Bayesian Nash Equilibrium (BNE) to Perfect Bayesian Equilibrium (PBE) Flix Muoz-Garca School of Economic Sciences Washington State University BNEs and Sequential rationality So far we have learned how to nd BNEs in incomplete

1.04k views • 60 slides
List-coloring in claw-free perfect graphs Lucas Pastor Joint-work with Sylvain Gravier and

List-coloring in claw-free perfect graphs Lucas Pastor Joint-work with Sylvain Gravier and

List-coloring in claw-free perfect graphs Lucas Pastor Joint-work with Sylvain Gravier and Frdric Maffray G-SCOP June 30 July 2, 2015 Lucas Pastor (G-SCOP) List-coloring in claw-free perfect graphs June 30 July 2, 2015 1 / 16

720 views • 50 slides
List-coloring in claw-free perfect graphs Lucas Pastor Joint-work with Sylvain Gravier and

List-coloring in claw-free perfect graphs Lucas Pastor Joint-work with Sylvain Gravier and

List-coloring in claw-free perfect graphs Lucas Pastor Joint-work with Sylvain Gravier and Frdric Maffray JGA 2015 04/11/15 Lucas Pastor (JGA 2015) List-coloring in claw-free perfect graphs 04/11/15 1 / 21 Coloring Coloring Given a

783 views • 74 slides
Perfect matchings in O ( n log n ) time in regular bipartite graphs -Ashish Goel, Michael

Perfect matchings in O ( n log n ) time in regular bipartite graphs -Ashish Goel, Michael

Perfect matchings in O ( n log n ) time in regular bipartite graphs -Ashish Goel, Michael Kapralov and Sanjeev Khanna October 20, 2019 -Ashish Goel, Michael Kapralov and Sanjeev Khanna Perfect matchings in regular bipartite graphs October 20,

654 views • 48 slides
Explaining Consumption Excess Sensitivity with Near-Rationality: Evidence from Large

Explaining Consumption Excess Sensitivity with Near-Rationality: Evidence from Large

Explaining Consumption Excess Sensitivity with Near-Rationality: Evidence from Large Predetermined Payments Lorenz Kueng Northwestern University and NBER Intro Data MPC Near-Rationality Liquidity CE Conclusion || Appendix: C vs. X Spec

574 views • 46 slides

More recommend