A Combinatorial Algorithm for Strong Implementation of Social Choice Functions Clemens ThielenStephan Westphal 3rd International Workshop on Computational.

Slides:



Advertisements
Similar presentations
A Minimum Cost Path Search Algorithm Through Tile Obstacles Zhaoyun Xing and Russell Kao Sun Microsystems Laboratories.
Advertisements

Random Walks for Vector Field Denoising João Paixão, Marcos Lage, Fabiano Petronetto, Alex Laier, Sinésio Pesco, Geovan Tavares, Thomas Lewiner, Hélio.
Maximum Flow and Minimum Cut Problems In this handout: Duality theory Upper bounds for maximum flow value Minimum Cut Problem Relationship between Maximum.
Min Cost Flow: Polynomial Algorithms. Overview Recap: Min Cost Flow, Residual Network Potential and Reduced Cost Polynomial Algorithms Approach Capacity.
Network Security: an Economic Perspective Marc Lelarge (INRIA-ENS) currently visiting STANFORD TRUST seminar, Berkeley 2011.
Planning based on Model Checking Dept. of Information Systems and Applied CS Bamberg University Seminar Paper Svetlana Balinova.
Prof. Amr Goneid, AUC1 Analysis & Design of Algorithms (CSCE 321) Prof. Amr Goneid Department of Computer Science, AUC Part R4. Disjoint Sets.
CS412/413 Introduction to Compilers Radu Rugina Lecture 37: DU Chains and SSA Form 29 Apr 02.
Honolulu, 23 rd of May 2011PESOS Evaluating the Compatibility of Conversational Service Interactions Sam Guinea and Paola Spoletini.
26 September 2003U. Buy -- SEES 2003 Sidestepping verification complexity with supervisory control Ugo Buy Department of Computer Science Houshang Darabi.
Multiagent Coordination Using a Distributed Combinatorial Auction Jose M. Vidal University of South Carolina AAAI Workshop on Auction Mechanisms for Robot.
A POLYNOMIAL COMBINATORIAL ALGORITHM FOR GENERALIZED MINIMUM COST FLOW, KEVIN D. WAYNE Eyal Dushkin –
Strong Implementation of Social Choice Functions in Dominant Strategies Clemens ThielenSven O. Krumke 3rd International Workshop on Computational Social.
Numbers
Balanced Graph Partitioning Konstantin Andreev Harald Räcke.
Inference in Probabilistic Ontologies with Attributive Concept Descriptions and Nominals Rodrigo Bellizia Polastro and Fabio Gagliardi Cozman.
Maximum Flow and Minimum Cut Problems In this handout: Good choices for augmenting paths Duality theory Upper bounds for maximum flow value Minimum Cut.
Amortized Rigidness in Dynamic Cartesian Trees Iwona Białynicka-Birula and Roberto Grossi Università di Pisa STACS 2006.
Jean-Charles REGIN Michel RUEHER ILOG Sophia Antipolis Université de Nice – Sophia Antipolis A global constraint combining.
Applications of Depth-First Search
Projects. Dataflow analysis Dataflow analysis: what is it? A common framework for expressing algorithms that compute information about a program Why.
Yashar Ganjali High Performance Networking Group Stanford University September 17, 2003 Minimum-delay Routing.
Improved results for a memory allocation problem Rob van Stee University of Karlsruhe Germany Leah Epstein University of Haifa Israel WADS 2007 WAOA 2007.
Automatic Complexity Analysis of Simple Imperative Programs Zachi Mann.
1. What is the difference between a solution for an equation and a solution for an inequality? (complete sentences please)
Contact Profile
Computer modelling of the concentration dependence of doping in solid state ionic materials Robert A Jackson School of Physical and Geographical Sciences,
On the implementability of the Lindahl correspondence by means of an anonymous mechanism Sébastien Rouillon GREThA, Bordeaux 4 Journées LAGV, 2008.
Combinatorial Optimization Minimum Cuts in Undirected Graphs Global Minimum Cuts.
computer
The Graph Minor Theorem CS594 GRAPH THEORY PRESENTATION SPRING 2014 RON HAGAN.
Speaker: Yoni Rozenshein Instructor: Prof. Zeev Nutov.
Set Operations and Compound Inequalities. 1. Use A = {2, 3, 4, 5, 6}, B = {1, 3, 5, 7, 9}, and C = {2, 4, 6, 8} to find each set.
Software to Go with the Flow. Software Engineering Step #1 Analyze the problem. Step #1 Analyze the problem. Step #2 Design the architecture of a solution.
A Generalization of Forward-backward Algorithm Ai Azuma Yuji Matsumoto Nara Institute of Science and Technology.
Sudip Biswas 1, Stephane Durocher 2, Debajyoti Mondal 2 and Rahnuma Islam Nishat 3 Hamiltonian Paths and Cycles in Planar Graphs 1 Department of Computer.
Hon Wai Leong, NUS (CS6234, Spring 2009) Page 1 Copyright © 2009 by Leong Hon Wai CS6234: Lecture 4  Linear Programming  LP and Simplex Algorithm [PS82]-Ch2.
Joel Oren, University of Toronto
Breadth First Search and Depth First Search. Greatest problem in Computer Science Has lead to a lot of new ideas and data structures Search engines before.
Copyright © Curt Hill Graphs Definitions and Implementations.
Progress Report ekker. Problem Definition In cases such as object recognition, we can not include all possible objects for training. So transfer learning.
Coordinates You will need your graph worksheet Interpret the Graph Below: The graph shows an object which is not moving (at rest). The distance stays.
Network applications Sushmita Roy BMI/CS 576 Dec 9 th, 2014.
Approximation Algorithms Duality My T. UF.
FAST-PPR: Personalized PageRank Estimation for Large Graphs Peter Lofgren (Stanford) Joint work with Siddhartha Banerjee (Stanford), Ashish Goel (Stanford),
Multiple-goal Search Algorithms and their Application to Web Crawling Dmitry Davidov and Shaul Markovitch Computer Science Department Technion, Haifa 32000,
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
10-1 人生与责任 淮安工业园区实验学校 连芳芳 “ 自我介绍 ” “ 自我介绍 ” 儿童时期的我.
Exact vector channel sum rules at finite temperature Talk at the ECT* workshop “Advances in transport and response properties of strongly interacting systems”
How Inclusive Has Development Been In Pakistan?
HOUSING MARKETS: graphs & co.
Solve: 1) x + 5 = 9. x + 5 > 9 2) y – 6 = -3
Market Equilibrium Ruta Mehta.
Increasing Decreasing Constant Functions.
Notes Over 2.1 Graph the numbers on a number line. Then write two inequalities that compare the two numbers and and 9 l l l.
GCD and Optimization Problem
Yahoo Mail Customer Support Number
Most Effective Techniques to Park your Manual Transmission Car
How do Power Car Windows Ensure Occupants Safety
Systems of Inequalities
Absolute Value inequalities
3.5 Minimum Cuts in Undirected Graphs
Department of Computer Science University of York
THANK YOU!.
Thank you.
Thank you.
Partition Refinement 更多精品PPT模板下载： 1
Compound Inequalities and their Graphs
Line Graphs.
Presentation transcript:

A Combinatorial Algorithm for Strong Implementation of Social Choice Functions Clemens ThielenStephan Westphal 3rd International Workshop on Computational Social Choice 15 September 2010

Problem Definition Social choice setting with private information: A Combinatorial Algorithm for Strong Implementation of Social Choice Functions

Problem Definition (2) We saw (previous talk): A Combinatorial Algorithm for Strong Implementation of Social Choice Functions

Our Results A Combinatorial Algorithm for Strong Implementation of Social Choice Functions

System of Inequalities Implementation of a social choice function : A Combinatorial Algorithm for Strong Implementation of Social Choice Functions Weak Implementation Strong Implementation

Node Potential Interpretation System can be interpreted as finding a node potential: A Combinatorial Algorithm for Strong Implementation of Social Choice Functions constant

Characterization (Weak Implementation) Characterization (Weak Implementation) A Combinatorial Algorithm for Strong Implementation of Social Choice Functions Theorem:[Gui et al. 2005]

Characterization (Strong Implementation) Characterization (Strong Implementation) A Combinatorial Algorithm for Strong Implementation of Social Choice Functions Theorem:[this paper]

The Algorithm The Algorithm A Combinatorial Algorithm for Strong Implementation of Social Choice Functions For weak implementation : For strong implementation : Strict inequalities in the system must be fullfilled.

Perturbation of Node Potentials Perturbation of Node Potentials A Combinatorial Algorithm for Strong Implementation of Social Choice Functions

Perturbation in Graph G i Perturbation in Graph G i A Combinatorial Algorithm for Strong Implementation of Social Choice Functions Slack of arc ( x, x ´) Slack of incoming arcs becomes positive

Finding the Node x A Combinatorial Algorithm for Strong Implementation of Social Choice Functions You shrink it!

Summary of Results A Combinatorial Algorithm for Strong Implementation of Social Choice Functions

Thank you! A Combinatorial Algorithm for Strong Implementation of Social Choice Functions

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.