+ 
+
+
+ Welcome to Technion WordPress MU. This is your first post. Edit or delete it, then start blogging!
+You must be logged in to post a comment.
+
+
+
+ May 4th, 2017 – Submission of contributions to workshops;
+June 4th, 2017 – Workshop paper acceptance notification;
+June 10th, 2017 – Deadline for final camera ready copy to workshop organizers.
The workshop will be held during August 19-21, 2017. The final date is not set yet.
+
+
+
+
+ Please answer what do you think about this paper:
+ +
+ 
+
+
+ In case of any mismatch between the sessions specified here and in the program, the program is correct.
+#1 Deliberation and Epistemic Democracy
+Huihui Ding, Marcus Pivato
+Sessions 1,C
+[ Paper | 1-min video ]
+
#2 Strongly Budget Balanced Auctions for Multi-Sided Markets
+Rica Gonen, Erel Segal-Halevi
+Sessions 3,D
+[ Paper ]
+
#5 On the Indecisiveness of Kelly-Strategyproof Social Choice Functions
+Felix Brandt, Martin Bullinger, Patrick Lederer
+Sessions 5,A
+[ Paper | 1-min video | 15 min presentation ]
+
#6 Finding and Recognizing Popular Coalition Structures
+Felix Brandt, Martin Bullinger
+Session 4
+[ Paper ]
+
#7 Approximate Group Fairness for Clustering
+Bo Li, Lijun Li, Ankang Sun, Chenhao Wang, Yingfan Wang
+Sessions 1,C
+[ Paper | 1-min video ]
+
#9 The Smoothed Satisfaction of Voting Axioms
+Lirong Xia
+Session 6
+[ Paper ]
+
#10 For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods
+Jonathan Scarlett, Nicholas Teh, Yair Zick
+Sessions 1,C
+[ Paper ]
+
#11 Weighted Envy-Freeness in Indivisible Item Allocation
+Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, Yair Zick
+Session 3
+[ Paper | Arxiv version | slides ]
+
#17 Fair and efficient collective decisions via nondeterministic proportional consensus
+Jobst Heitzig, Forest W. Simmons
+Sessions 1,C
+[ Paper | 1-min video | social app development project ]
+
#18 Reaping the Informational Surplus in Bayesian Persuasion
+Ronen Gradwohl, Niklas Hahn, Martin Hoefer, Rann Smorodinsky
+Session 3
+[ Paper | Arxiv version ]
+
#22 Threshold Task Games: Theory, Platform and Experiments
+Kobi Gal, Ta Duy Nguyen, Quang Nhat Tran, Yair Zick
+Sessions 3,C
+[ Paper ]
+
#23 Modeling Voters in Multi-Winner Approval Voting
+Jaelle Scheuerman, Jason Harman, Nicholas Mattei, K. Brent Venable
+Session 4
+[ Paper | Video presentation ]
+
#25 Nash Welfare and Facility Location
+Alexander Lam, Haris Aziz, Toby Walsh
+Sessions 3,C
+[ Paper | 1-min video ]
+
#26 Worst Case in Voting and Bargaining
+Anna Bogomolnaia, Ron Holzman, Herve Moulinlin
+Session 5
+[ Paper ]
+
#27 Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences
+Haris Aziz, Bo Li, Xiaowei Wu
+Session 3
+[ Paper ]
+
#28 Election Score Can Be Harder Than Winner
+Zack Fitzsimmons, Edith Hemaspaandra
+Session 6
+[ Paper ]
+
#29 Every choice function is pro-con rationalizable
+Serhat Dogan, Kemal Yildiz
+Session 5
+[ Paper ]
+
#30 The Smoothed Likelihood of Doctrinal Paradoxes
+Ao Liu, Lirong Xia
+Sessions 2,D
+[ Paper | 1-min video ]
+
#31 Strategy-Proofness implies Minimal Participation if Voting is Costly
+Michael Mueller, Clemens Puppe
+Session 5
+[ Paper | My homepage ]
+
#32 Indecision Modeling
+Duncan C McElfresh, Lok Chan, Kenzie Doyle, Walter Sinnott-Armstrong, Vincent Conitzer, Jana Schaich Borg, John P Dickerson
+Session 2
+[ Paper ]
+
#33 Fair Cake-Cutting Algorithms with Real Land-Value Data
+Itay Shtechman, Rica Gonen, Erel Segal-HaLevi
+Sessions 1,C
+[ Paper ]
+
#35 Decision Scoring Rules
+Caspar Oesterheld, Vincent Conitzer
+Session 7
+[ Paper | Up-to-date version ]
+
#36 Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments
+Steven Jecmen, Hanrui Zhang, Ryan Liu, Nihar B. Shah, Vincent Conitzer, Fei Fang
+Session 2
+[ Paper ]
+
#37 Loss Functions, Axioms, and Peer Review
+Ritesh Noothigattu, Nihar B. Shah, Ariel Procaccia
+Sessions 7,B
+[ Paper | 1-min video | JAIR version ]
+
#39 United for Change: Deliberative Coalition Formation to Change the Status Quo
+Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon
+Sessions 5,A
+[ Paper | 1-min video ]
+
#40 A Closer Look at the Cake-Cutting Foundations through the Lens of Measure Theory
+Peter Kern, Daniel Neugebauer, Jörg Rothe, René L. Schilling, Dietrich Stoyan, Robin Weishaupt
+Sessions 4,D
+[ Paper | 1-min video ]
+
#41 On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
+Umang Bhaskar, AR Sricharan, Rohit Vaish
+Sessions 3,C
+[ Paper | Arxiv version ]
+
#43 Complexity of Sequential Rules in Judgment Aggregation
+Dorothea Baumeister, Linus Boes, Robin Weishaupt
+Session 1
+[ Paper ]
+
#44 Relaxed Notions of Condorcet-Consistency and Efficiency for Strategyproof Social Decision Schemes
+Felix Brandt, Patrick Lederer, René Romen
+Session 5
+[ Paper ]
+
#45 Four Faces of Altruistic Hedonic Games
+Anna Maria Kerkmann, Jörg Rothe
+Sessions 7,B
+[ Paper | 1-min video ]
+
#46 Complexity of Scheduling and Predicting Round-Robin Tournaments
+Dorothea Baumeister, Tobias Hogrebe
+Sessions 6,A
+[ Paper | 1-min video ]
+
#47 Online selection of diverse committees
+Virginie Do, Jamal Atif, Jérôme Lang, Nicolas Usunier
+Sessions 4,A
+[ Paper | 1-min video ]
+
#49 Primarily About Primaries
+Allan Borodin, Omer Lev, Nisarg Shah, Tyrone Strangway
+Session 6
+[ Paper ]
+
#50 Learning preferences in an accumulation-to-threshold model of decision making
+Taher Rahgooy, K. Brent Venable, Jerome R. Busemeyer
+Sessions 7,B
+[ Paper ]
+
#52 Mind the Gap: Cake Cutting With Separation
+Edith Elkind, Erel Segal-Halevi, Warut Suksompong
+Session 4
+[ Paper | Arxiv version | One minute pitch ]
+
#55 Approval-Based Apportionment
+Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, Kai Wilker
+Session 2
+[ Paper ]
+
#56 Perpetual Voting: The Axiomatic Lens
+Martin Lackner, Jan Maly
+Session 6
+[ Paper ]
+
#57 Efficient Computation and Strategic Control in Conditional Approval Voting
+Markakis Evangelos, Papasotiropoulos Georgios
+Sessions 5,A
+[ Paper ]
+
#58 Equitable Division of a Path
+Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan, Rohit Vaish
+Sessions 2,D
+[ Paper | 1-min video | Arxiv version | Slides ]
+
#59 Tracking Truth by Weighting Proxies in Liquid Democracy
+Yuzhe Zhang, Davide Grossi
+Sessions 5,A
+[ Paper | 1-min video ]
+
#60 Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space
+Niclas Boehmer, Markus Brill, Ulrike Schmidt-Kraepelin
+Sessions 4,A
+[ Paper | 1-min video ]
+
#61 Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation
+Simon Rey, Ulle Endriss, Ronald de Haan
+Session 1
+[ Paper ]
+
#63 Dynamic Proportional Rankings
+Jonas Israel, Markus Brill
+Session 4
+[ Paper ]
+
#64 Manipulation of Opinion Polls to Influence Iterative Elections
+Dorothea Baumeister, Ann-Kathrin Selker, Anaelle Wilczynski
+Sessions 6,A
+[ Paper | 1-min video ]
+
#66 Behavioral Stable Marriage Problems
+Andrea Martin, Kristen Brent Venable, Nicholas Mattei
+Sessions 2,D
+[ Paper ]
+
#69 Proportional Representation under Single-Crossing Preferences Revisited
+Andrei Constantinescu, Edith Elkind
+Sessions 1,D
+[ Paper | 1-min video ]
+
#70 On (Coalitional) Exchange-Stable Matching
+Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge
+Session 7
+[ Paper | Arxiv version ]
+
#71 Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments
+Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
+Sessions 6,B
+[ Paper | 1-min video ]
+
#72 Putting a Compass on the Map of Elections
+Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanisław Szufa
+Session 7
+[ Paper ]
+
#73 The Price is (Probably) Right: Learning Market Equilibria from Samples
+Omer Lev, Neel Patel, Vignesh Viswanathan, Yair Zick
+Session 7
+[ Paper | Arxiv version ]
+
#74 Guaranteeing Maximin Shares: Some Agents Left Behind
+Hadi Hosseini, Andrew Searns
+Sessions 2,D
+[ Paper | 1-min video ]
+
#77 Keeping Your Friends Close: Land Allocation with Friends
+Edith Elkind, Neel Patel, Alan Tsang, Yair Zick
+Sessions 2,D
+[ Paper | 1-min video ]
+
#78 Making Group Decisions from Natural Language-Based Preferences
+Farhad Mohsin, Lei Luo, Wufei Ma, Inwon Kang, Zhibing Zhao, Ao Liu, Rohit Vaish, Lirong Xia
+Session 2
+[ Paper | video presentation ]
+
#80 High Dimensional Model Explanations: An Axiomatic Approach
+Neel Patel, Martin Strobel, Yair Zick
+Sessions 7,B
+[ Paper ]
+
#81 Finding Fair and Efficient Allocations When Valuations Don’t Add Up
+Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick
+Sessions 3,C
+[ Paper ]
+
#82 The Borda Class: An Axiomatic Study of the Borda Rule on Top-Truncated Preferences
+Zoi Terzopoulou, Ulle Endriss
+Session 6
+[ Paper ]
+
#83 Little House (Seat) on the Prairie: Compactness, Gerrymandering, and Population Distribution
+Allan Borodin, Omer Lev, Nisarg Shah, Tyrone Strangway
+Sessions 4,B
+[ Paper ]
+
#84 Multistage Committee Elections
+Robert Bredereck,Till Fluschnik, Andrzej Kaczmarczyk
+Sessions 7,B
+[ Paper | 1-min video | Arxiv version ]
+
#85 Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with an Application to False-name Manipulation
+Yotam Gafni, Ron Lavi, Moshe Tennenholtz
+Sessions 6,B
+[ Paper ]
+
#86 Unified Fair Allocation for Indivisible Goods and Chores via Copies
+Yotam Gafni, Xin Huang, Ron Lavi, Inbal Talgam-Cohen
+Session 3
+[ Paper ]
+
#87 Best-of-Both-Worlds Fair-Share Allocations
+Moshe Babaioff, Tomer Ezra, and Uriel Feige
+Session 3
+[ Paper ]
+
#89 On social networks that support learning
+Itai Arieli, Fedor Sandomirskiy, Rann Smorodinsky
+Sessions 4,D
+[ Paper | 1-min video ]
+
#90 (Almost Full) EFX Exists for Four Agents (and Beyond)
+Ben Berger, Avi Cohen, Michal Feldman, Amos Fiat
+Session 2
+[ Paper | Arxiv version ]
+
#91 Fair-Share Allocations for Agents with Arbitrary Entitlements
+Moshe Babaioff, Tomer Ezra, and Uriel Feige
+Sessions 6,B
+[ Paper | 1-min video ]
+
#94 Proportional Participatory Budgeting with Cardinal Utilities
+Dominik Peters, Grzegorz Pierczyński, Piotr Skowron
+Session 1
+[ Paper ]
+
#95 Market-Based Explanations of Collective Decisions
+Dominik Peters, Grzegorz Pierczyński, Nisarg Shah, Piotr Skowron
+Session 7
+[ Paper ]
+
#96 Evaluating Committees for Representative Democracies: the Distortion and Beyond
+Michał Jaworski and Piotr Skowron
+Sessions 5,A
+[ Paper | 1-min video ]
+
#97 An Analysis of Approval-Based Committee Rules for 2D-Euclidean Elections
+Michał Tomasz Godziszewski, PAweł Batko, Piotr Skowron, Piotr Faliszewski
+Session 4
+[ Paper ]
+
#99 Proportional Approval Voting, Harmonic k-Median, and Negative Association
+Jarosław Byrka, Piotr Skowron and Krzysztof Sornat
+Session 1
+[ Paper | Poster | Full technical slides ]
+
+
+
+
+ The workshop will start on Monday, June 7th.
+You can see the full program here (click on [details] to see a detailed schedule of that day).
+COMSOC-2021 will run on the Gather.town platform, via VirtualChair.
+There is a link to the virtual venue on the homepage. If you are registered, then you got a password (via email) that you will need to log in. If you do not have the password you can write to Reshef.
+Note that the capacity of the virtual venue is limited, so please do not pass on the password to people who have not registered.
+Upon entering, you can modify your character’s appearance and name. We ask you to use your full name for easy identification. Also note that Gather.town does not work well on mobile devices. Make sure you have a stable internet connection, a camera and a mic, so you can have conversations with other participants.
+We had two orientation sessions. If you missed them, don’t worry! you can enter the virtual venue (using the link on the home page) any time, and have a self-guided tour. Upon entering, you will find yourself in the Garden:
+
From here, “walk” (with the arrow keys) to the Lobby (door marked with a yellow arrow). You will then be at the Lobby:
+
There is a TV screen (circled in red) showing an instructional video. During the workshop there will also be a VirtualChair attendant for technical assistance from within the platform. All the talks are in the Plenary room (follow the blue arrow).
+Once in the Plenary room, you may stand anywhere and click x to enter the Zoom session.
+If you have trouble connecting or cannot find the attendant, please email to
+help+comsoc-2021@virtualchair.net
+To attend a talk session you will be asked to walk into the Plenary room in the virtual venue. There you can stand anywhere and click the x key to “interact” with the room and enter the zoom session.
+There will not be designated time for questions during the regular talks. You are encouraged to ask questions via chat (zoom chat or gather room chat). The authors of the paper will try to answer during or after the talk using the chat. After each session, there will be a 30 min Q&A break, where you can meet the speaker at their poster and ask questions.
All posters (except the student poster session) will be on the main Lobby, just outside the Plenary room. To see a poster, just walk close to it and use the x key to interact.
+The students’ posters will be displayed at the poster room.
Posters are only displayed during their designated sessions. If you want to show someone your poster when it is not on display, use the Gather screen sharing option.
+COMSOC 2021 encourages you to actively participate! Check out voting on best presentations, and our interactive game session.
++
+
+
+
+ All lectures will take place at room Cooper 216 (entrance floor). See map, or use map link.
+
+ From 4pm, the program will be hybrid and broadcasted on Zoom. +
|
+ |
+
The restrictions on passengers arriving to Israel are changing according to the current situation. Our working assumption is that by June there will be no quarantine restrictions for arrivals of vaccinated people from some countries. Please check for the latest travel information here.
+TL;DR (as of April 22nd):
+Visa and entry permit information is available here. If you need an invitation letter or any other help please contact Reshef at reshefm@ie.technion.ac.il.
+There is a direct train line from Ben-Gurion airport, with 4 train stations in Haifa (the train also stops in Tel Aviv on the way). The ride takes about 90 minutes. Train service is currently suspended due to COVID restrictions. Train currently operates regularly. See updates here. Price is about 40 NIS.
The train does not operate on weekends (from Friday noon until Saturday evening).
+There is a regular taxi service from the airport to Haifa (door to door). Price is about 120 NIS per person. No need to reserve. The service operates 24/7 (check for COVID updates).
+A special (private) taxi from the airport to Haifa costs about 400 NIS.
+There are multiple car rental options available at the airport. Information on driving in Israel with a foreign license is available here.
+There will be limited availability of cheap housing for attendees with priority for students. If you plan to arrive and need a housing arrangement, please contact Reshef by email.
++
+ 
+
+
+ It seems we can’t find what you’re looking for. Perhaps searching can help.
+ +
+
+
+
+ Please answer what do you think about this paper:
+ + +The workshop will be held during August 19-21, 2017. The final date is not set yet.
+]]>
+
+
+
+ May 4th, 2017 – Submission of contributions to workshops;
+June 4th, 2017 – Workshop paper acceptance notification;
+June 10th, 2017 – Deadline for final camera ready copy to workshop organizers.
The workshop will be held during August 19-21, 2017. The final date is not set yet.
+ +Welcome to Technion WordPress MU. This is your first post. Edit or delete it, then start blogging!
+ +
+
+
+
+ The awards were given based on participants’ Approval votes. Only the name of the presenter appears, as votes were based on the quality and engagement of the presentation, rather than the technical quality of the paper (although of course the papers may also be very good :).
+ +
+Best Student Poster+Election with dependent voters (by Théo Delemazure) ++ Second place: +Proxy Manipulation for Better Outcomes (by Gili Bielous) +Computing Kemeny Rankings From d-Euclidean Preferences (by Anna Rapberger) |
++ + | + |
+
| + + | ++ + | ++ |
 |
++ |
+Best Poster Presentation+Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space (by Markus Brill) ++ Second place: +Four Faces of Altruistic Hedonic Games (by Anna Maria Kerkmann) +On the Indecisiveness of Kelly-Strategyproof Social Choice Functions (by Patrick Lederer) +Loss Functions, Axioms, and Peer Review (by Nihar B. Shah) |
+
| + | + | + + | +
+Best Oral Presentation+Putting a Compass on the Map of Elections (by Piotr Faliszewski) ++ Second place: +Dynamic Proportional Rankings (Jonas Israel) ++ Third place: +Approval-Based Apportionment (by Ulrike Schmidt-Kraepelin) |
++ + | + |
+
+
+
+
+
+ The deadline for submitting papers has passed.
+For submitting student posters, see here.
+For industry track, see here.
+Submissions of papers describing original, under review, or recently published work on all aspects of computational social choice are invited. Topics of interest include, but are not limited to computational issues that arise in the analysis of
+We welcome theoretical, empirical and experimental work on these topics, including, in particular, research on algorithms (exact, approximate, parameterized, online and distributed), learning, logic, and simulations in the context of social choice.
+As in previous years, we welcome submissions of papers that have been recently accepted or that are currently under review.
+Papers will have to be submitted electronically via Easychair. All submitted papers will be reviewed by the program committee. Accepted papers will be collected in informal workshop notes; however, the workshop has no formal proceedings and the authors retain their copyright. Each accepted paper will have to be presented by one of the authors, with the constraint that each workshop participant gives at most one talk (exceptions can be made due to unforeseen circumstances).
+ +o Paper registration deadline (non-mandatory but please register): March 1, 2021
+o Paper submission deadline: March 1, 2021 March 4, 2021 (anywhere on Earth)
o Notification of authors: mid April, 2021
+o Workshop dates: June 7-10, 2021
++ +
+
+
+
+
+ COMSOC-2021 will include a student poster session. Any student may present at most one student poster, regardless of whether they have a paper in the main program.
+Student poster submissions will be lightly reviewed for relevance and fit to COMSOC. The presenter of the poster must register to the workshop. Posters will be presented both online and on-site.
+The Deadline for submitting posters is Tuesday May 11 extended to Friday May 14, 2021 (anywhere on Earth). Posters arriving later will be handled based on available slots. Notifications will be sent until May 17.
The submission must include:
++
Submission Form for Students’ posters (not via EasyChair):
+https://forms.gle/4eKSZQR8YtycE9yw8
+
+
+
+
+ The XXIX EUROPEAN WORKSHOP ON ECONOMIC THEORY – EWET 2021
+JUNE 7-9, AKKO, ISRAEL
https://sites.google.com/view/ewet2021/home
+Akko is about 35min drive from the Technion, and is accessible by car or train.
+Another event that is not co-located but relevant is:
+Dagstuhl Seminar 21241: Coalition Formation Games, June 13 – 18, Dagstuhl, Germany
+https://www.dagstuhl.de/en/program/calendar/semhp/?semnr=21241
+ The COMSOC Workshop SeriesThe aim of the COMSOC workshop series is to bring together different communities: computer scientists interested in computational issues in social choice; people working in artificial intelligence and multiagent systems who are using ideas from social choice to organize societies of artificial software agents; logicians interested in the logic-based specification and analysis of social procedures; and last but not least people coming from social choice theory itself. The COMSOC series website |  |
| | COMSOC on Gather.town with VirtualChairMost of the COMSOC'21 program will be online in a virtual conference center built by VirtualChair on the Gather.town platform. This is an interactive environment that lets participants present their papers and posters, discuss and socialize using video, audio and chat.See Attending Online for further information. |
COVID-19 updateCOMSOC'21 will feature one hybrid day at the Technion, Israel, on Tuesday June 8th. The rest of the program will be online. See program. For up-to-date information on entry to Israel requirements, see Local Information. |  |
| Dorothea | Baumeister | Universitaet Duesseldorf |
| Peter | Biro | Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences |
| Robert | Bredereck | HU Berlin |
| Markus | Brill | TU Berlin |
| Ioannis | Caragiannis | University of Patras |
| Katarina | Cechlarova | PF UPJS Kosice |
| Jiehua | Chen | TU Wien |
| Ronald | de Haan | University of Amsterdam |
| Palash | Dey | TIFR Mumbai |
| John | Dickerson | University of Maryland |
| Edith | Elkind | Oxford University |
| Ulle | Endriss | University of Amsterdam |
| Piotr | Faliszewski | AGH University of Science and Technology |
| Yuval | Filmus | Technion-Israel Institute of Technology |
| Zack | Fitzsimmons | College of the Holy Cross |
| Rica | Gonen | Open University of Israel |
| Umberto | Grandi | University of Toulouse |
| Ayumi | Igarashi | National Institute of Informatics, Japan |
| Martin | Lackner | TU Wien |
| Jerome | Lang | Paris Dauphine |
| Omer | Lev | Ben-Gurion University |
| Nicholas | Mattei | Tulane University |
| Nicolas | Maudet | Université Pierre et Marie Curie |
| Vangelis | Markakis | Athens University of Economics and Business |
| Vincent | Merlin | Caen University |
| Alan | Miller | Western University |
| Neeldhara | Misra | Indian Institute of Technology Gandhinagar |
| David | Pennock | Microsoft Research |
| Dominik | Peters | Harvard University |
| Jörg | Rothe | Universität Düsseldorf |
| Ehud | Shapiro | Weizmann Institute of Science |
| Piotr | Skowron | Warshaw University |
| Arkadii | Slinko | University of Auckland |
| Nimrod | Talmon | Weizmann Institute of Science |
| Alan | Tsang | Carleton University |
| Paolo | Turrini | Warwick University |
| Brent | Venable | U of West Florida |
| Toby | Walsh | University of New South Wales |
| Gerhard | Woeginger | RWTH Aachen |
| Lirong | Xia | Rensselaer Polytechnic Institute |
| Yongjie | Yang | Universität des Saarlandes |
| Makoto | Yokoo | Kyushu University |
| Yair | Zick | National University of Singapore |
| Day: | Monday, June 7th | Tuesday, June 8th | Wednesday, June 9th | Thursday, June 10th |
| hours: | 4pm-10:30pm (online only) | 3pm-9:30pm (hybrid day) | 4pm-10:30pm (online only) | 4pm-10:30pm (online only) |
| Special event(s): | Opening Plenary: Maya Bar-Hillel (Hebrew U.) | Free food :) Plenary: Gil Kalai (Hebrew U.) | Community meeting | Plenary: Gabrielle Demange (Paris School of Economics) Closing |
Title: On proportionality in non-simple problems
Abstract: Proportionality is an old and intuitive principle, easy to define in uni-dimensional problems but much less so in many practical situations. What is a proportional representation of parties in a multi-district assembly? What is a proportional resolution among a network of financially linked firms? How to measure the deviation to a proportional allocation of minorities to schools? There is not a single answer to these questions, as each problem faces different constraints. In this talk, I will discuss solutions based on the same methodology, the optimization of an entropy index. In ‘bi-dimensional’ problems, the solutions are related to well-studied bi-proportional matrices and their computation through matrix-scaling algorithms.
]]> -
All lectures will take place at room Cooper 216 (entrance floor). See map, or use map link.
|  |
From here, "walk" (with the arrow keys) to the Lobby (door marked with a yellow arrow). You will then be at the Lobby: 
There is a TV screen (circled in red) showing an instructional video. During the workshop there will also be a VirtualChair attendant for technical assistance from within the platform. All the talks are in the Plenary room (follow the blue arrow). Once in the Plenary room, you may stand anywhere and click x to enter the Zoom session. help+comsoc-2021@virtualchair.net
Go group B! ]]>
-
Best Student PosterElection with dependent voters (by Théo Delemazure) Second place: Proxy Manipulation for Better Outcomes (by Gili Bielous) Computing Kemeny Rankings From d-Euclidean Preferences (by Anna Rapberger) |  | |
 | Best Poster PresentationSelecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space (by Markus Brill) Second place: Four Faces of Altruistic Hedonic Games (by Anna Maria Kerkmann) On the Indecisiveness of Kelly-Strategyproof Social Choice Functions (by Patrick Lederer) Loss Functions, Axioms, and Peer Review (by Nihar B. Shah) | |
Best Oral PresentationPutting a Compass on the Map of Elections (by Piotr Faliszewski) Second place: Dynamic Proportional Rankings (Jonas Israel) Third place: Approval-Based Apportionment (by Ulrike Schmidt-Kraepelin) |  |
The workshop will be held during August 19-21, 2017. The final date is not set yet.
+]]>
+
+
+
+ On Wed. June 9th, 5:30pm Israel time (10:30am EST), we will have a special session of interactive social choice games!
+You can watch the recorded games here:
++ +
+
Go group B!
++
Test page
+ + + + + +
+ 
+
+
+ Thank you all for participating! See you in next COMSOC!
+News:+Best presentation awards (based on your votes) are here. +You can watch the games we played and the final scores (up to counting errors) here. +You are welcome to continue our discussion on including online/hybrid components in future COMSOC on our Facebook group. +
|
+
+The COMSOC Workshop Series+The aim of the COMSOC workshop series is to bring together different communities: computer scientists interested in computational issues in social choice; people working in artificial intelligence and multiagent systems who are using ideas from social choice to organize societies of artificial software agents; logicians interested in the logic-based specification and analysis of social procedures; and last but not least people coming from social choice theory itself. + |
+ |
+
|
+ |
+
+COMSOC on Gather.town with VirtualChair+Most of the COMSOC’21 program will be online in a virtual conference center built by VirtualChair on the Gather.town platform. +This is an interactive environment that lets participants present their papers and posters, discuss and socialize using video, audio and chat. ++ See Attending Online for further information.
+ |
+
|
+
+
+COVID-19 update+COMSOC’21 will feature one hybrid day at the Technion, Israel, on Tuesday June 8th. The rest of the program will be online. See program.
+
+For up-to-date information on entry to Israel requirements, see Local Information.
+
+
++ |
+ |
+
+
+
+
+
+
+ Welcome to Technion WordPress MU. This is your first post. Edit or delete it, then start blogging!
+
+
+
+
+ All lectures will take place at room Cooper 216 (entrance floor). See map, or use map link.
+
+ From 4pm, the program will be hybrid and broadcasted on Zoom. +
|
+ |
+
The restrictions on passengers arriving to Israel are changing according to the current situation. Our working assumption is that by June there will be no quarantine restrictions for arrivals of vaccinated people from some countries. Please check for the latest travel information here.
+TL;DR (as of April 22nd):
+Visa and entry permit information is available here. If you need an invitation letter or any other help please contact Reshef at reshefm@ie.technion.ac.il.
+There is a direct train line from Ben-Gurion airport, with 4 train stations in Haifa (the train also stops in Tel Aviv on the way). The ride takes about 90 minutes. Train service is currently suspended due to COVID restrictions. Train currently operates regularly. See updates here. Price is about 40 NIS.
The train does not operate on weekends (from Friday noon until Saturday evening).
+There is a regular taxi service from the airport to Haifa (door to door). Price is about 120 NIS per person. No need to reserve. The service operates 24/7 (check for COVID updates).
+A special (private) taxi from the airport to Haifa costs about 400 NIS.
+There are multiple car rental options available at the airport. Information on driving in Israel with a foreign license is available here.
+There will be limited availability of cheap housing for attendees with priority for students. If you plan to arrive and need a housing arrangement, please contact Reshef by email.
++
+
+
+
+ This COMSOC, we hope to initiate a small applications/industrial program. This will be the right venue for work dealing with applying social choice in the real world, from gerrymandering districts for political parties, through applying participatory budgets in municipalities, to dealing with office politics using a novel organizational decision making process. We hope to hear from people working, consulting or advising governments, regional offices, municipalities and organizations on how they build their systems, and which problems and challenges they are facing. This includes both talks or demos of actual products or techniques used in the real-world.
+What Should I Do?
+If you are a person using COMSOC ideas and techniques in industry — great! We’d love to talk to you about participating in COMSOC 2021. Please contact our industry chair (contact details below), and send about 2 pages describing your use of COMSOC techniques in real-world settings. Feel free to attach a link to your company, organization or institution.
+Submission deadline is May 10, 2021.
+If you are familiar with people in the decision making trenches, please forward them this call. Consider also forwarding the industry chair (details below) their details so that we may contact them as well.
+Contact — COMSOC 2021 Industry Chair
+————————————-
+Omer Lev, Ben-Gurion University of the Negev.
+Email: omerlev@bgu.ac.il
+
+
+
+ The deadline for submitting papers has passed.
+For submitting student posters, see here.
+For industry track, see here.
+Submissions of papers describing original, under review, or recently published work on all aspects of computational social choice are invited. Topics of interest include, but are not limited to computational issues that arise in the analysis of
+We welcome theoretical, empirical and experimental work on these topics, including, in particular, research on algorithms (exact, approximate, parameterized, online and distributed), learning, logic, and simulations in the context of social choice.
+As in previous years, we welcome submissions of papers that have been recently accepted or that are currently under review.
+Papers will have to be submitted electronically via Easychair. All submitted papers will be reviewed by the program committee. Accepted papers will be collected in informal workshop notes; however, the workshop has no formal proceedings and the authors retain their copyright. Each accepted paper will have to be presented by one of the authors, with the constraint that each workshop participant gives at most one talk (exceptions can be made due to unforeseen circumstances).
+ +o Paper registration deadline (non-mandatory but please register): March 1, 2021
+o Paper submission deadline: March 1, 2021 March 4, 2021 (anywhere on Earth)
o Notification of authors: mid April, 2021
+o Workshop dates: June 7-10, 2021
++ +
+
+
+
+
+ Regular papers should not exceed 12 pages in length, excluding references, contact information and a clearly-marked appendix of arbitrary length that will be read at the discretion of the PC members. When preparing your submission, please follow these formatting instructions. The easiest way of doing so is to use the Latex typesetting system with the class file comsoc2020.cls. The formatting instructions are based on a sample file (comsoc2020.tex, comsoc2020.pdf), which you can use as a starting point for your own paper (the filenames with 2020 still apply for 2021).
+You will be able to revise your submission any number of times before the deadline.
+All submissions will be electronic via the EasyChair page for the conference (open for submissions)
+All submitted papers will be reviewed by the program committee (review is not double-blind, and there is no need to anonymize your submission). Accepted papers will be collected in informal workshop notes and will not be printed. To accommodate the publishing needs of different scientific communities, we stress that authors will retain the copyright of their papers and that submitting to COMSOC-2021 does not preclude publication of the same material in a journal or in a conference with formal proceedings.
+Submission of regular papers is restricted by the rule that a single person can present at most one paper at the workshop.
+COMSOC does not require anonymous submissions, but this is allowed (e.g. in case you want to comply with anonymity requirements of other conferences, or for any other reason). You can open a new Easychair account, or ask the program chairs to submit on your behalf (then your submission will be anonymous for the reviewers but not to us). If you are interested in the latter option, please contact Reshef before March 1st.
+COMSOC-2021 will allow the submission of papers describing recent applications of computational social choice to real world problems, reports on implemented and deployed tools, etc. See call for papers here.
+COMSOC-2021 will also include a student poster session. See details here. Posters will be selected based on abstracts. Unlike regular submissions, they will not be reviewed by the program committee; the intention is to accept all posters that fall within the scope of the workshop subject to space constraints.
++
+
+
+
+ The XXIX EUROPEAN WORKSHOP ON ECONOMIC THEORY – EWET 2021
+JUNE 7-9, AKKO, ISRAEL
https://sites.google.com/view/ewet2021/home
+Akko is about 35min drive from the Technion, and is accessible by car or train.
+Another event that is not co-located but relevant is:
+Dagstuhl Seminar 21241: Coalition Formation Games, June 13 – 18, Dagstuhl, Germany
+https://www.dagstuhl.de/en/program/calendar/semhp/?semnr=21241
+
+
+
+
+ COMSOC-2021 will include a student poster session. Any student may present at most one student poster, regardless of whether they have a paper in the main program.
+Student poster submissions will be lightly reviewed for relevance and fit to COMSOC. The presenter of the poster must register to the workshop. Posters will be presented both online and on-site.
+The Deadline for submitting posters is Tuesday May 11 extended to Friday May 14, 2021 (anywhere on Earth). Posters arriving later will be handled based on available slots. Notifications will be sent until May 17.
The submission must include:
++
Submission Form for Students’ posters (not via EasyChair):
+https://forms.gle/4eKSZQR8YtycE9yw8
+
+
+
+
+ Papers accepted as talks will be assigned 15 minutes of a live talk. In addition, each paper will be assigned a poster slot during the short break after the session. The idea is that visitors can meet the authors at the poster for Q&A during the break.
+Papers accepted as posters will be assigned a slot twice: once in a designated poster session, and once in one of the short breaks together with the talk-posters. A promotional 1-minute video for the poster will be displayed at the end of the corresponding session, immediately after the talks. The video will also be available to watch throughout the poster session.
+Submission deadline is May 12 for all related materials (paper, poster, video). Please do not wait until the last minute so we can solve any issue that may arise in time.
+Submission is not via Easychair but via a Google form that was sent to the authors.
+Regular papers should not exceed 12 pages in length, excluding references, contact information and a clearly-marked appendix. When preparing your submission, please follow these formatting instructions. The easiest way of doing so is to use the Latex typesetting system with the class file comsoc2020.cls. The formatting instructions are based on a sample file (comsoc2020.tex, comsoc2020.pdf), which you can use as a starting point for your own paper (the filenames with 2020 still apply for 2021).
+Make sure you deanonymize the paper, and take reviewers’ comments into account when preparing the final version.
+During the workshop, participants will vote on the best talks and best posters. Make sure you bring honor to your lab!
+
+
+
+
+ May 4th, 2017 – Submission of contributions to workshops;
+June 4th, 2017 – Workshop paper acceptance notification;
+June 10th, 2017 – Deadline for final camera ready copy to workshop organizers.
The workshop will be held during August 19-21, 2017. The final date is not set yet.
+
+
+
+
+ Please answer what do you think about this paper:
+ +
+
+
+
+ Every talk is 15 min, with no time for questions. Speakers and coauthors can answer questions in the chat (hybrid talks on Tuesday will get 15min + 5 min for questions).
+After every session there will be a 30 min Q&A break on gather.town, where people are encouraged to meet speakers at their posters and ask questions.
+Note that every Program Poster appears twice: in one of the poster sessions (A/B/C/D), AND in one of the Q&A breaks on a different day.
+Paper details appear here.
+ ++
+
+
+
+ In case of any mismatch between the sessions specified here and in the program, the program is correct.
+#1 Deliberation and Epistemic Democracy
+Huihui Ding, Marcus Pivato
+Sessions 1,C
+[ Paper | 1-min video ]
+
#2 Strongly Budget Balanced Auctions for Multi-Sided Markets
+Rica Gonen, Erel Segal-Halevi
+Sessions 3,D
+[ Paper ]
+
#5 On the Indecisiveness of Kelly-Strategyproof Social Choice Functions
+Felix Brandt, Martin Bullinger, Patrick Lederer
+Sessions 5,A
+[ Paper | 1-min video | 15 min presentation ]
+
#6 Finding and Recognizing Popular Coalition Structures
+Felix Brandt, Martin Bullinger
+Session 4
+[ Paper ]
+
#7 Approximate Group Fairness for Clustering
+Bo Li, Lijun Li, Ankang Sun, Chenhao Wang, Yingfan Wang
+Sessions 1,C
+[ Paper | 1-min video ]
+
#9 The Smoothed Satisfaction of Voting Axioms
+Lirong Xia
+Session 6
+[ Paper ]
+
#10 For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods
+Jonathan Scarlett, Nicholas Teh, Yair Zick
+Sessions 1,C
+[ Paper ]
+
#11 Weighted Envy-Freeness in Indivisible Item Allocation
+Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, Yair Zick
+Session 3
+[ Paper | Arxiv version | slides ]
+
#17 Fair and efficient collective decisions via nondeterministic proportional consensus
+Jobst Heitzig, Forest W. Simmons
+Sessions 1,C
+[ Paper | 1-min video | social app development project ]
+
#18 Reaping the Informational Surplus in Bayesian Persuasion
+Ronen Gradwohl, Niklas Hahn, Martin Hoefer, Rann Smorodinsky
+Session 3
+[ Paper | Arxiv version ]
+
#22 Threshold Task Games: Theory, Platform and Experiments
+Kobi Gal, Ta Duy Nguyen, Quang Nhat Tran, Yair Zick
+Sessions 3,C
+[ Paper ]
+
#23 Modeling Voters in Multi-Winner Approval Voting
+Jaelle Scheuerman, Jason Harman, Nicholas Mattei, K. Brent Venable
+Session 4
+[ Paper | Video presentation ]
+
#25 Nash Welfare and Facility Location
+Alexander Lam, Haris Aziz, Toby Walsh
+Sessions 3,C
+[ Paper | 1-min video ]
+
#26 Worst Case in Voting and Bargaining
+Anna Bogomolnaia, Ron Holzman, Herve Moulinlin
+Session 5
+[ Paper ]
+
#27 Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences
+Haris Aziz, Bo Li, Xiaowei Wu
+Session 3
+[ Paper ]
+
#28 Election Score Can Be Harder Than Winner
+Zack Fitzsimmons, Edith Hemaspaandra
+Session 6
+[ Paper ]
+
#29 Every choice function is pro-con rationalizable
+Serhat Dogan, Kemal Yildiz
+Session 5
+[ Paper ]
+
#30 The Smoothed Likelihood of Doctrinal Paradoxes
+Ao Liu, Lirong Xia
+Sessions 2,D
+[ Paper | 1-min video ]
+
#31 Strategy-Proofness implies Minimal Participation if Voting is Costly
+Michael Mueller, Clemens Puppe
+Session 5
+[ Paper | My homepage ]
+
#32 Indecision Modeling
+Duncan C McElfresh, Lok Chan, Kenzie Doyle, Walter Sinnott-Armstrong, Vincent Conitzer, Jana Schaich Borg, John P Dickerson
+Session 2
+[ Paper ]
+
#33 Fair Cake-Cutting Algorithms with Real Land-Value Data
+Itay Shtechman, Rica Gonen, Erel Segal-HaLevi
+Sessions 1,C
+[ Paper ]
+
#35 Decision Scoring Rules
+Caspar Oesterheld, Vincent Conitzer
+Session 7
+[ Paper | Up-to-date version ]
+
#36 Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments
+Steven Jecmen, Hanrui Zhang, Ryan Liu, Nihar B. Shah, Vincent Conitzer, Fei Fang
+Session 2
+[ Paper ]
+
#37 Loss Functions, Axioms, and Peer Review
+Ritesh Noothigattu, Nihar B. Shah, Ariel Procaccia
+Sessions 7,B
+[ Paper | 1-min video | JAIR version ]
+
#39 United for Change: Deliberative Coalition Formation to Change the Status Quo
+Edith Elkind, Davide Grossi, Ehud Shapiro, Nimrod Talmon
+Sessions 5,A
+[ Paper | 1-min video ]
+
#40 A Closer Look at the Cake-Cutting Foundations through the Lens of Measure Theory
+Peter Kern, Daniel Neugebauer, Jörg Rothe, René L. Schilling, Dietrich Stoyan, Robin Weishaupt
+Sessions 4,D
+[ Paper | 1-min video ]
+
#41 On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
+Umang Bhaskar, AR Sricharan, Rohit Vaish
+Sessions 3,C
+[ Paper | Arxiv version ]
+
#43 Complexity of Sequential Rules in Judgment Aggregation
+Dorothea Baumeister, Linus Boes, Robin Weishaupt
+Session 1
+[ Paper ]
+
#44 Relaxed Notions of Condorcet-Consistency and Efficiency for Strategyproof Social Decision Schemes
+Felix Brandt, Patrick Lederer, René Romen
+Session 5
+[ Paper ]
+
#45 Four Faces of Altruistic Hedonic Games
+Anna Maria Kerkmann, Jörg Rothe
+Sessions 7,B
+[ Paper | 1-min video ]
+
#46 Complexity of Scheduling and Predicting Round-Robin Tournaments
+Dorothea Baumeister, Tobias Hogrebe
+Sessions 6,A
+[ Paper | 1-min video ]
+
#47 Online selection of diverse committees
+Virginie Do, Jamal Atif, Jérôme Lang, Nicolas Usunier
+Sessions 4,A
+[ Paper | 1-min video ]
+
#49 Primarily About Primaries
+Allan Borodin, Omer Lev, Nisarg Shah, Tyrone Strangway
+Session 6
+[ Paper ]
+
#50 Learning preferences in an accumulation-to-threshold model of decision making
+Taher Rahgooy, K. Brent Venable, Jerome R. Busemeyer
+Sessions 7,B
+[ Paper ]
+
#52 Mind the Gap: Cake Cutting With Separation
+Edith Elkind, Erel Segal-Halevi, Warut Suksompong
+Session 4
+[ Paper | Arxiv version | One minute pitch ]
+
#55 Approval-Based Apportionment
+Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, Kai Wilker
+Session 2
+[ Paper ]
+
#56 Perpetual Voting: The Axiomatic Lens
+Martin Lackner, Jan Maly
+Session 6
+[ Paper ]
+
#57 Efficient Computation and Strategic Control in Conditional Approval Voting
+Markakis Evangelos, Papasotiropoulos Georgios
+Sessions 5,A
+[ Paper ]
+
#58 Equitable Division of a Path
+Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan, Rohit Vaish
+Sessions 2,D
+[ Paper | 1-min video | Arxiv version | Slides ]
+
#59 Tracking Truth by Weighting Proxies in Liquid Democracy
+Yuzhe Zhang, Davide Grossi
+Sessions 5,A
+[ Paper | 1-min video ]
+
#60 Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space
+Niclas Boehmer, Markus Brill, Ulrike Schmidt-Kraepelin
+Sessions 4,A
+[ Paper | 1-min video ]
+
#61 Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation
+Simon Rey, Ulle Endriss, Ronald de Haan
+Session 1
+[ Paper ]
+
#63 Dynamic Proportional Rankings
+Jonas Israel, Markus Brill
+Session 4
+[ Paper ]
+
#64 Manipulation of Opinion Polls to Influence Iterative Elections
+Dorothea Baumeister, Ann-Kathrin Selker, Anaelle Wilczynski
+Sessions 6,A
+[ Paper | 1-min video ]
+
#66 Behavioral Stable Marriage Problems
+Andrea Martin, Kristen Brent Venable, Nicholas Mattei
+Sessions 2,D
+[ Paper ]
+
#69 Proportional Representation under Single-Crossing Preferences Revisited
+Andrei Constantinescu, Edith Elkind
+Sessions 1,D
+[ Paper | 1-min video ]
+
#70 On (Coalitional) Exchange-Stable Matching
+Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge
+Session 7
+[ Paper | Arxiv version ]
+
#71 Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments
+Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier
+Sessions 6,B
+[ Paper | 1-min video ]
+
#72 Putting a Compass on the Map of Elections
+Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanisław Szufa
+Session 7
+[ Paper ]
+
#73 The Price is (Probably) Right: Learning Market Equilibria from Samples
+Omer Lev, Neel Patel, Vignesh Viswanathan, Yair Zick
+Session 7
+[ Paper | Arxiv version ]
+
#74 Guaranteeing Maximin Shares: Some Agents Left Behind
+Hadi Hosseini, Andrew Searns
+Sessions 2,D
+[ Paper | 1-min video ]
+
#77 Keeping Your Friends Close: Land Allocation with Friends
+Edith Elkind, Neel Patel, Alan Tsang, Yair Zick
+Sessions 2,D
+[ Paper | 1-min video ]
+
#78 Making Group Decisions from Natural Language-Based Preferences
+Farhad Mohsin, Lei Luo, Wufei Ma, Inwon Kang, Zhibing Zhao, Ao Liu, Rohit Vaish, Lirong Xia
+Session 2
+[ Paper | video presentation ]
+
#80 High Dimensional Model Explanations: An Axiomatic Approach
+Neel Patel, Martin Strobel, Yair Zick
+Sessions 7,B
+[ Paper ]
+
#81 Finding Fair and Efficient Allocations When Valuations Don’t Add Up
+Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick
+Sessions 3,C
+[ Paper ]
+
#82 The Borda Class: An Axiomatic Study of the Borda Rule on Top-Truncated Preferences
+Zoi Terzopoulou, Ulle Endriss
+Session 6
+[ Paper ]
+
#83 Little House (Seat) on the Prairie: Compactness, Gerrymandering, and Population Distribution
+Allan Borodin, Omer Lev, Nisarg Shah, Tyrone Strangway
+Sessions 4,B
+[ Paper ]
+
#84 Multistage Committee Elections
+Robert Bredereck,Till Fluschnik, Andrzej Kaczmarczyk
+Sessions 7,B
+[ Paper | 1-min video | Arxiv version ]
+
#85 Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with an Application to False-name Manipulation
+Yotam Gafni, Ron Lavi, Moshe Tennenholtz
+Sessions 6,B
+[ Paper ]
+
#86 Unified Fair Allocation for Indivisible Goods and Chores via Copies
+Yotam Gafni, Xin Huang, Ron Lavi, Inbal Talgam-Cohen
+Session 3
+[ Paper ]
+
#87 Best-of-Both-Worlds Fair-Share Allocations
+Moshe Babaioff, Tomer Ezra, and Uriel Feige
+Session 3
+[ Paper ]
+
#89 On social networks that support learning
+Itai Arieli, Fedor Sandomirskiy, Rann Smorodinsky
+Sessions 4,D
+[ Paper | 1-min video ]
+
#90 (Almost Full) EFX Exists for Four Agents (and Beyond)
+Ben Berger, Avi Cohen, Michal Feldman, Amos Fiat
+Session 2
+[ Paper | Arxiv version ]
+
#91 Fair-Share Allocations for Agents with Arbitrary Entitlements
+Moshe Babaioff, Tomer Ezra, and Uriel Feige
+Sessions 6,B
+[ Paper | 1-min video ]
+
#94 Proportional Participatory Budgeting with Cardinal Utilities
+Dominik Peters, Grzegorz Pierczyński, Piotr Skowron
+Session 1
+[ Paper ]
+
#95 Market-Based Explanations of Collective Decisions
+Dominik Peters, Grzegorz Pierczyński, Nisarg Shah, Piotr Skowron
+Session 7
+[ Paper ]
+
#96 Evaluating Committees for Representative Democracies: the Distortion and Beyond
+Michał Jaworski and Piotr Skowron
+Sessions 5,A
+[ Paper | 1-min video ]
+
#97 An Analysis of Approval-Based Committee Rules for 2D-Euclidean Elections
+Michał Tomasz Godziszewski, PAweł Batko, Piotr Skowron, Piotr Faliszewski
+Session 4
+[ Paper ]
+
#99 Proportional Approval Voting, Harmonic k-Median, and Negative Association
+Jarosław Byrka, Piotr Skowron and Krzysztof Sornat
+Session 1
+[ Paper | Poster | Full technical slides ]
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ +
TALKS:
+POSTERS:
+
+
+
+
+ The workshop will start on Monday, June 7th.
+You can see the full program here (click on [details] to see a detailed schedule of that day).
+COMSOC-2021 will run on the Gather.town platform, via VirtualChair.
+There is a link to the virtual venue on the homepage. If you are registered, then you got a password (via email) that you will need to log in. If you do not have the password you can write to Reshef.
+Note that the capacity of the virtual venue is limited, so please do not pass on the password to people who have not registered.
+Upon entering, you can modify your character’s appearance and name. We ask you to use your full name for easy identification. Also note that Gather.town does not work well on mobile devices. Make sure you have a stable internet connection, a camera and a mic, so you can have conversations with other participants.
+We had two orientation sessions. If you missed them, don’t worry! you can enter the virtual venue (using the link on the home page) any time, and have a self-guided tour. Upon entering, you will find yourself in the Garden:
+
From here, “walk” (with the arrow keys) to the Lobby (door marked with a yellow arrow). You will then be at the Lobby:
+
There is a TV screen (circled in red) showing an instructional video. During the workshop there will also be a VirtualChair attendant for technical assistance from within the platform. All the talks are in the Plenary room (follow the blue arrow).
+Once in the Plenary room, you may stand anywhere and click x to enter the Zoom session.
+If you have trouble connecting or cannot find the attendant, please email to
+help+comsoc-2021@virtualchair.net
+To attend a talk session you will be asked to walk into the Plenary room in the virtual venue. There you can stand anywhere and click the x key to “interact” with the room and enter the zoom session.
+There will not be designated time for questions during the regular talks. You are encouraged to ask questions via chat (zoom chat or gather room chat). The authors of the paper will try to answer during or after the talk using the chat. After each session, there will be a 30 min Q&A break, where you can meet the speaker at their poster and ask questions.
All posters (except the student poster session) will be on the main Lobby, just outside the Plenary room. To see a poster, just walk close to it and use the x key to interact.
+The students’ posters will be displayed at the poster room.
Posters are only displayed during their designated sessions. If you want to show someone your poster when it is not on display, use the Gather screen sharing option.
+COMSOC 2021 encourages you to actively participate! Check out voting on best presentations, and our interactive game session.
++
+
+
+
+ The student poster session will take place on Wednesday, June 9th, 7:30pm Israel time (12:30pm EST).
++
S1 Strategic Behavior is Bliss: Iterative Voting Improves Social Welfare , Joshua Kavner
+S2 Truthful Information Elicitation from Hybrid Crowd , Qishen Han
+S3 Computing Kemeny Rankings From d-Euclidean Preferences , Anna Rapberger
+S4 For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods , Nicholas Teh
+S5 A VCG Adaptation For Participatory Budgeting , Jonathan Wagner
+S6 Regret-Minimizing Bayesian Persuasion , Konstantin Zabarnyi
+S7 Proportional Participatory Budgeting with Substitute Projects , Roy Fairstein
+S8 Belief Aggregation and Trader Compensation in Infinite Outcome Prediction Markets , Blake Martin
+S9 Searching, Sorting, and Cake Cutting in Rounds , Nicholas Recker
+S10 Iterative Deliberation via Metric Aggregation , Eyal Leizerovich
+S11 Fundamental Limits and Algorithms for Maximizing Reviewer-Assignment Quality under Strategyproof Partitioning , Komal Dhull
+S12 On the Hardness of Safe Bribery , Neel Karia
+S13 Proxy Manipulation for Better Outcomes , Gili Bielous
+S14 DiRe Committee: Diversity and Representation Constraints in Multiwinner Elections , Kunal Relia
+S15 Election with dependent voters , Théo Delemazure
+S16 Level Strategy-Proofness: Aggregating Probabilities in an incentive compatible way , Estelle Varloot
+S17 EMPIRICAL BAYES APPROACH TO TRUTH DISCOVERY , Tsviel Ben Shabbat
+S18 Anti-Collusion Distanced Online Testing , Jingwen Qian
+
+
+
+
+ During and between the sessions, you will be able to vote on your favorite talks and posters. The best submissions in each category will receive a (virtual) award!
+To vote, look for the voting booth in the corresponding room, and click the X key to interact. You will need a Google account in order to vote, and you can revise your vote at any time.
+Student posters: Wed. June 9th, 8:15pm (end of poster session)
+Talks: Thu. June 10th, 8:30pm (after last talk session)
+Posters: Thu., June 10th, 9pm (middle of last poster session)
+
+
+
+
+ On Wed. June 9th, 5:30pm Israel time (10:30am EST), we will have a special session of interactive social choice games!
+You can watch the recorded games here:
++ +
+
Go group B!
++
+
+
+
+  |
+ |
+
 |
+ |
+
 |
+ |
+
 |
+ |
+
 |
+ |
+
+
+
+
+ The awards were given based on participants’ Approval votes. Only the name of the presenter appears, as votes were based on the quality and engagement of the presentation, rather than the technical quality of the paper (although of course the papers may also be very good :).
+ +
+Best Student Poster+Election with dependent voters (by Théo Delemazure) ++ Second place: +Proxy Manipulation for Better Outcomes (by Gili Bielous) +Computing Kemeny Rankings From d-Euclidean Preferences (by Anna Rapberger) |
++ + | + |
+
| + + | ++ + | ++ |
 |
++ |
+Best Poster Presentation+Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space (by Markus Brill) ++ Second place: +Four Faces of Altruistic Hedonic Games (by Anna Maria Kerkmann) +On the Indecisiveness of Kelly-Strategyproof Social Choice Functions (by Patrick Lederer) +Loss Functions, Axioms, and Peer Review (by Nihar B. Shah) |
+
| + | + | + + | +
+Best Oral Presentation+Putting a Compass on the Map of Elections (by Piotr Faliszewski) ++ Second place: +Dynamic Proportional Rankings (Jonas Israel) ++ Third place: +Approval-Based Apportionment (by Ulrike Schmidt-Kraepelin) |
++ + | + |
+
+
+
+
+
+ Bill Zwicker (Union College) zwickerw@union.edu
+Reshef Meir (Technion-Israel Institute of Technology) reshefm@ie.technion.ac.il
Omer Lev (Ben Gurion University)
+Nimrod Talmon (Ben Gurion University)
+Ehud Shapiro (Weizmann Institute)
+Omer Lev
+Piotr Skowron
+Inbal Rozencweig
+Gil Leibiker
+Jonny Wagner
+| Dorothea | +Baumeister | +Universitaet Duesseldorf | +
| Peter | +Biro | +Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences | +
| Robert | +Bredereck | +HU Berlin | +
| Markus | +Brill | +TU Berlin | +
| Ioannis | +Caragiannis | +University of Patras | +
| Katarina | +Cechlarova | +PF UPJS Kosice | +
| Jiehua | +Chen | +TU Wien | +
| Ronald | +de Haan | +University of Amsterdam | +
| Palash | +Dey | +TIFR Mumbai | +
| John | +Dickerson | +University of Maryland | +
| Edith | +Elkind | +Oxford University | +
| Ulle | +Endriss | +University of Amsterdam | +
| Piotr | +Faliszewski | +AGH University of Science and Technology | +
| Yuval | +Filmus | +Technion-Israel Institute of Technology | +
| Zack | +Fitzsimmons | +College of the Holy Cross | +
| Rica | +Gonen | +Open University of Israel | +
| Umberto | +Grandi | +University of Toulouse | +
| Ayumi | +Igarashi | +National Institute of Informatics, Japan | +
| Martin | +Lackner | +TU Wien | +
| Jerome | +Lang | +Paris Dauphine | +
| Omer | +Lev | +Ben-Gurion University | +
| Nicholas | +Mattei | +Tulane University | +
| Nicolas | +Maudet | +Université Pierre et Marie Curie | +
| Vangelis | +Markakis | +Athens University of Economics and Business | +
| Vincent | +Merlin | +Caen University | +
| Alan | +Miller | +Western University | +
| Neeldhara | +Misra | +Indian Institute of Technology Gandhinagar | +
| David | +Pennock | +Microsoft Research | +
| Dominik | +Peters | +Harvard University | +
| Jörg | +Rothe | +Universität Düsseldorf | +
| Ehud | +Shapiro | +Weizmann Institute of Science | +
| Piotr | +Skowron | +Warshaw University | +
| Arkadii | +Slinko | +University of Auckland | +
| Nimrod | +Talmon | +Weizmann Institute of Science | +
| Alan | +Tsang | +Carleton University | +
| Paolo | +Turrini | +Warwick University | +
| Brent | +Venable | +U of West Florida | +
| Toby | +Walsh | +University of New South Wales | +
| Gerhard | +Woeginger | +RWTH Aachen | +
| Lirong | +Xia | +Rensselaer Polytechnic Institute | +
| Yongjie | +Yang | +Universität des Saarlandes | +
| Makoto | +Yokoo | +Kyushu University | +
| Yair | +Zick | +National University of Singapore | +
+
+
+
+ Monday, June 7th, 4:30pm (Israel time). Online only.
+Tuesday, June 8th, 4pm (Israel time). At the Technion (Cooper 216) and online.
+Title: Quantitative and qualitative aspects of social choice theory
+Abstract: Arrow’s theorem is a far reaching extension of Condorcet’s paradox for the majority rule to general voting rules. We will ask to what extent other properties of the majority rule have such wide extensions, and what are some properties of the majority rule that distinguish it from other voting rules.
+Thursday, June 10th, 4pm (Israel time). Online only.
+Title: On proportionality in non-simple problems
+Abstract: Proportionality is an old and intuitive principle, easy to define in uni-dimensional problems but much less so in many practical situations. What is a proportional representation of parties in a multi-district assembly? What is a proportional resolution among a network of financially linked firms? How to measure the deviation to a proportional allocation of minorities to schools? There is not a single answer to these questions, as each problem faces different constraints. In this talk, I will discuss solutions based on the same methodology, the optimization of an entropy index. In ‘bi-dimensional’ problems, the solutions are related to well-studied bi-proportional matrices and their computation through matrix-scaling algorithms.
+
+
+
+
+
+Local poster session + Coffee and Ice cream+On Tuesday June 8th, 3pm (Israel time) we will hold a poster session outside room Cooper 216. +Everyone who has a paper in the workshop (regular or student) is welcome to bring their poster. This is in addition to any scheduled online presentation. +The local poster session is not part of the hybrid program. +If you have a relevant poster you want to present, that is not included in the program, this is also fine but let us know so we will make sure there are enough poster stands. |
+ |
+
 |
+
+Local dinner+After the end of schedule on Tuesday, you are welcome to join us for dinner at Biga Horev (a kosher restaurant). +Dinner is included in the registration fee. +If you plan to join, please register here until Sunday 6.6, so we can order enough seats. |
+
+
+
+
+
+ This COMSOC, we hope to initiate a small applications/industrial program. This will be the right venue for work dealing with applying social choice in the real world, from gerrymandering districts for political parties, through applying participatory budgets in municipalities, to dealing with office politics using a novel organizational decision making process. We hope to hear from people working, consulting or advising governments, regional offices, municipalities and organizations on how they build their systems, and which problems and challenges they are facing. This includes both talks or demos of actual products or techniques used in the real-world.
+What Should I Do?
+If you are a person using COMSOC ideas and techniques in industry — great! We’d love to talk to you about participating in COMSOC 2021. Please contact our industry chair (contact details below), and send about 2 pages describing your use of COMSOC techniques in real-world settings. Feel free to attach a link to your company, organization or institution.
+Submission deadline is May 10, 2021.
+If you are familiar with people in the decision making trenches, please forward them this call. Consider also forwarding the industry chair (details below) their details so that we may contact them as well.
+Contact — COMSOC 2021 Industry Chair
+————————————-
+Omer Lev, Ben-Gurion University of the Negev.
+Email: omerlev@bgu.ac.il
+
+
+
+ +
TALKS:
+POSTERS:
+
+
+
+
+ Monday, June 7th, 4:30pm (Israel time). Online only.
+Tuesday, June 8th, 4pm (Israel time). At the Technion (Cooper 216) and online.
+Title: Quantitative and qualitative aspects of social choice theory
+Abstract: Arrow’s theorem is a far reaching extension of Condorcet’s paradox for the majority rule to general voting rules. We will ask to what extent other properties of the majority rule have such wide extensions, and what are some properties of the majority rule that distinguish it from other voting rules.
+Thursday, June 10th, 4pm (Israel time). Online only.
+Title: On proportionality in non-simple problems
+Abstract: Proportionality is an old and intuitive principle, easy to define in uni-dimensional problems but much less so in many practical situations. What is a proportional representation of parties in a multi-district assembly? What is a proportional resolution among a network of financially linked firms? How to measure the deviation to a proportional allocation of minorities to schools? There is not a single answer to these questions, as each problem faces different constraints. In this talk, I will discuss solutions based on the same methodology, the optimization of an entropy index. In ‘bi-dimensional’ problems, the solutions are related to well-studied bi-proportional matrices and their computation through matrix-scaling algorithms.
+
+
+
+
+ Bill Zwicker (Union College) zwickerw@union.edu
+Reshef Meir (Technion-Israel Institute of Technology) reshefm@ie.technion.ac.il
Omer Lev (Ben Gurion University)
+Nimrod Talmon (Ben Gurion University)
+Ehud Shapiro (Weizmann Institute)
+Omer Lev
+Piotr Skowron
+Inbal Rozencweig
+Gil Leibiker
+Jonny Wagner
+| Dorothea | +Baumeister | +Universitaet Duesseldorf | +
| Peter | +Biro | +Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences | +
| Robert | +Bredereck | +HU Berlin | +
| Markus | +Brill | +TU Berlin | +
| Ioannis | +Caragiannis | +University of Patras | +
| Katarina | +Cechlarova | +PF UPJS Kosice | +
| Jiehua | +Chen | +TU Wien | +
| Ronald | +de Haan | +University of Amsterdam | +
| Palash | +Dey | +TIFR Mumbai | +
| John | +Dickerson | +University of Maryland | +
| Edith | +Elkind | +Oxford University | +
| Ulle | +Endriss | +University of Amsterdam | +
| Piotr | +Faliszewski | +AGH University of Science and Technology | +
| Yuval | +Filmus | +Technion-Israel Institute of Technology | +
| Zack | +Fitzsimmons | +College of the Holy Cross | +
| Rica | +Gonen | +Open University of Israel | +
| Umberto | +Grandi | +University of Toulouse | +
| Ayumi | +Igarashi | +National Institute of Informatics, Japan | +
| Martin | +Lackner | +TU Wien | +
| Jerome | +Lang | +Paris Dauphine | +
| Omer | +Lev | +Ben-Gurion University | +
| Nicholas | +Mattei | +Tulane University | +
| Nicolas | +Maudet | +Université Pierre et Marie Curie | +
| Vangelis | +Markakis | +Athens University of Economics and Business | +
| Vincent | +Merlin | +Caen University | +
| Alan | +Miller | +Western University | +
| Neeldhara | +Misra | +Indian Institute of Technology Gandhinagar | +
| David | +Pennock | +Microsoft Research | +
| Dominik | +Peters | +Harvard University | +
| Jörg | +Rothe | +Universität Düsseldorf | +
| Ehud | +Shapiro | +Weizmann Institute of Science | +
| Piotr | +Skowron | +Warshaw University | +
| Arkadii | +Slinko | +University of Auckland | +
| Nimrod | +Talmon | +Weizmann Institute of Science | +
| Alan | +Tsang | +Carleton University | +
| Paolo | +Turrini | +Warwick University | +
| Brent | +Venable | +U of West Florida | +
| Toby | +Walsh | +University of New South Wales | +
| Gerhard | +Woeginger | +RWTH Aachen | +
| Lirong | +Xia | +Rensselaer Polytechnic Institute | +
| Yongjie | +Yang | +Universität des Saarlandes | +
| Makoto | +Yokoo | +Kyushu University | +
| Yair | +Zick | +National University of Singapore | +
+
+
+
+  |
+ |
+
 |
+ |
+
 |
+ |
+
 |
+ |
+
 |
+ |
+
+
+
+
+ Every talk is 15 min, with no time for questions. Speakers and coauthors can answer questions in the chat (hybrid talks on Tuesday will get 15min + 5 min for questions).
+After every session there will be a 30 min Q&A break on gather.town, where people are encouraged to meet speakers at their posters and ask questions.
+Note that every Program Poster appears twice: in one of the poster sessions (A/B/C/D), AND in one of the Q&A breaks on a different day.
+Paper details appear here.
+ ++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Local poster session + Coffee and Ice cream+On Tuesday June 8th, 3pm (Israel time) we will hold a poster session outside room Cooper 216. +Everyone who has a paper in the workshop (regular or student) is welcome to bring their poster. This is in addition to any scheduled online presentation. +The local poster session is not part of the hybrid program. +If you have a relevant poster you want to present, that is not included in the program, this is also fine but let us know so we will make sure there are enough poster stands. |
+ |
+
 |
+
+Local dinner+After the end of schedule on Tuesday, you are welcome to join us for dinner at Biga Horev (a kosher restaurant). +Dinner is included in the registration fee. +If you plan to join, please register here until Sunday 6.6, so we can order enough seats. |
+
+
+
+
+
+ The student poster session will take place on Wednesday, June 9th, 7:30pm Israel time (12:30pm EST).
++
S1 Strategic Behavior is Bliss: Iterative Voting Improves Social Welfare , Joshua Kavner
+S2 Truthful Information Elicitation from Hybrid Crowd , Qishen Han
+S3 Computing Kemeny Rankings From d-Euclidean Preferences , Anna Rapberger
+S4 For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods , Nicholas Teh
+S5 A VCG Adaptation For Participatory Budgeting , Jonathan Wagner
+S6 Regret-Minimizing Bayesian Persuasion , Konstantin Zabarnyi
+S7 Proportional Participatory Budgeting with Substitute Projects , Roy Fairstein
+S8 Belief Aggregation and Trader Compensation in Infinite Outcome Prediction Markets , Blake Martin
+S9 Searching, Sorting, and Cake Cutting in Rounds , Nicholas Recker
+S10 Iterative Deliberation via Metric Aggregation , Eyal Leizerovich
+S11 Fundamental Limits and Algorithms for Maximizing Reviewer-Assignment Quality under Strategyproof Partitioning , Komal Dhull
+S12 On the Hardness of Safe Bribery , Neel Karia
+S13 Proxy Manipulation for Better Outcomes , Gili Bielous
+S14 DiRe Committee: Diversity and Representation Constraints in Multiwinner Elections , Kunal Relia
+S15 Election with dependent voters , Théo Delemazure
+S16 Level Strategy-Proofness: Aggregating Probabilities in an incentive compatible way , Estelle Varloot
+S17 EMPIRICAL BAYES APPROACH TO TRUTH DISCOVERY , Tsviel Ben Shabbat
+S18 Anti-Collusion Distanced Online Testing , Jingwen Qian
+
+
+
+
+ Papers accepted as talks will be assigned 15 minutes of a live talk. In addition, each paper will be assigned a poster slot during the short break after the session. The idea is that visitors can meet the authors at the poster for Q&A during the break.
+Papers accepted as posters will be assigned a slot twice: once in a designated poster session, and once in one of the short breaks together with the talk-posters. A promotional 1-minute video for the poster will be displayed at the end of the corresponding session, immediately after the talks. The video will also be available to watch throughout the poster session.
+Submission deadline is May 12 for all related materials (paper, poster, video). Please do not wait until the last minute so we can solve any issue that may arise in time.
+Submission is not via Easychair but via a Google form that was sent to the authors.
+Regular papers should not exceed 12 pages in length, excluding references, contact information and a clearly-marked appendix. When preparing your submission, please follow these formatting instructions. The easiest way of doing so is to use the Latex typesetting system with the class file comsoc2020.cls. The formatting instructions are based on a sample file (comsoc2020.tex, comsoc2020.pdf), which you can use as a starting point for your own paper (the filenames with 2020 still apply for 2021).
+Make sure you deanonymize the paper, and take reviewers’ comments into account when preparing the final version.
+During the workshop, participants will vote on the best talks and best posters. Make sure you bring honor to your lab!
+
+
+
+
+ Regular papers should not exceed 12 pages in length, excluding references, contact information and a clearly-marked appendix of arbitrary length that will be read at the discretion of the PC members. When preparing your submission, please follow these formatting instructions. The easiest way of doing so is to use the Latex typesetting system with the class file comsoc2020.cls. The formatting instructions are based on a sample file (comsoc2020.tex, comsoc2020.pdf), which you can use as a starting point for your own paper (the filenames with 2020 still apply for 2021).
+You will be able to revise your submission any number of times before the deadline.
+All submissions will be electronic via the EasyChair page for the conference (open for submissions)
+All submitted papers will be reviewed by the program committee (review is not double-blind, and there is no need to anonymize your submission). Accepted papers will be collected in informal workshop notes and will not be printed. To accommodate the publishing needs of different scientific communities, we stress that authors will retain the copyright of their papers and that submitting to COMSOC-2021 does not preclude publication of the same material in a journal or in a conference with formal proceedings.
+Submission of regular papers is restricted by the rule that a single person can present at most one paper at the workshop.
+COMSOC does not require anonymous submissions, but this is allowed (e.g. in case you want to comply with anonymity requirements of other conferences, or for any other reason). You can open a new Easychair account, or ask the program chairs to submit on your behalf (then your submission will be anonymous for the reviewers but not to us). If you are interested in the latter option, please contact Reshef before March 1st.
+COMSOC-2021 will allow the submission of papers describing recent applications of computational social choice to real world problems, reports on implemented and deployed tools, etc. See call for papers here.
+COMSOC-2021 will also include a student poster session. See details here. Posters will be selected based on abstracts. Unlike regular submissions, they will not be reviewed by the program committee; the intention is to accept all posters that fall within the scope of the workshop subject to space constraints.
++
+
+
+
+ During and between the sessions, you will be able to vote on your favorite talks and posters. The best submissions in each category will receive a (virtual) award!
+To vote, look for the voting booth in the corresponding room, and click the X key to interact. You will need a Google account in order to vote, and you can revise your vote at any time.
+Student posters: Wed. June 9th, 8:15pm (end of poster session)
+Talks: Thu. June 10th, 8:30pm (after last talk session)
+Posters: Thu., June 10th, 9pm (middle of last poster session)
+ Running jQuery - ' + jq_version + '
plugin: ' + plugin_ver + '
Sign in with Microsoft',o.onclick=t,n.appendChild(o),e.observePopupClosed()},this.observePopupClosed=function(){window.wpo365ReloadInterval=setInterval((function(){localStorage.getItem("wpo365PopupClosed")&&(localStorage.removeItem("wpo365PopupClosed"),clearInterval(window.wpo365ReloadInterval),e.redirectTo?e.isTeams?window.location.href=e.getServerRelativePath(e.redirectTo):window.location.href=-1==e.redirectTo.indexOf("http")?window.location.protocol+":/"+e.redirectTo:e.redirectTo:window.wpo365&&window.wpo365.siteUrl?e.isTeams?window.location.href=window.location.href=e.getServerRelativePath(window.wpo365.siteUrl):window.location.href=window.wpo365.siteUrl:window.location.reload())}),100)},this.uuidv4=function(){return"xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx".replace(/[xy]/g,(function(e){var t=16*Math.random()|0;return("x"==e?t:3&t|8).toString(16)}))},this.queryString=function(e){var t=e.indexOf("?");if(-1==t)return{};for(var n=e.substr(t+1).split("&"),o={},r=0;r
Anonymous says:
+