CALL FOR PAPERS, WORKSHOPS, AND TUTORIALS
Thirteenth ACM Conference on Electronic Commerce (EC’12)
June 4-8, 2012, Valencia, Spain
http://www.sigecom.org/ec12/
This conference includes areas of interest to CMSS members, such as Computational Social Choice, Preferences and Decision Theory. Invited speakers for the 3rd CMSS summer workshop, Edith Elkind and Jerome Lang, are senior programme committee members.
The Centre for Mathematical Social Science at The University of Auckland (New Zealand) is organizing a workshop on the theme “Algorithmic. Logical and Game-theoretic aspects of Social Choice” for 20-21 February 2012. The organizing committee is: Arkadii Slinko, Mark Wilson, Matthew Ryan. Invited speakers:
==================================================
CALL FOR PARTICIPATION
3rd Summer Workshop, The Centre for Mathematical Social Science (CMSS) at The University of Auckland, 20-21 February, 2012
==================================================
The Centre for Mathematical Social Science (CMSS) at The University of
Auckland (New Zealand) is planning to organize its 3rd Summer
Workshop, which will take place 20-21 February 2012 in Auckland. The umbrella title for the workshop is: “Algorithmic and game-theoretic aspects of social choice”. The confirmed speakers from overseas at this date are:
– Jerome Lang (Université Paris Dauphine)
– Toby Walsh (University of NSW and NICTA)
– Piotr Faliszewski (AGH Institute of Technology, Krakow)
– Edith Elkind (NTU, Singapore)
The formal presentations will be accompanied by research collaborations in small groups with participation from visitors and local researchers, including PhD
students. The proposed topics for these small group sessions are to be
discussed but will certainly include voting procedures and voting equilibria, manipulation of voting procedures, simple games and power indices.
The Centre is planning to provide financial support to seminar presenters but the exact amount of it will be known later, as it depends on the outcome of several grant applications. New participants are welcome. If you wish to participate please contact
Arkadii Slinko
Department of Mathematics
The University of Auckland,
Centre for Mathematics in Social Sciences
Seminar & Events Organizer
a.slinko@auckland.ac.nz
The programme co-chair Edith Elkind is a CMSS external affiliate and frequent visitor.
————-
WINE 2011, the 7th Workshop on Internet & Network Economics.
December 11-14, 2011, Singapore.
Over the past decade, there has been a growing interaction between
researchers in theoretical computer science, networking and security,
economics, mathematics, sociology, and management sciences devoted to
the analysis of problems arising from the Internet and the World Wide
Web. The Workshop on Internet & Network Economics (WINE) is an
interdisciplinary forum for the exchange of ideas and results arising
from these various fields. The seventh WINE will take place in
December, 2011 in Singapore.
All submissions will be peer-reviewed and evaluated on the basis of
the quality of their contribution, originality, soundness, and
significance. Industrial applications and position papers presenting
novel ideas, issues, challenges and directions are also welcome.
Submissions are invited in the following topics but not limited to:
* Algorithmic game theory
* Algorithmic mechanism design
* Auction algorithms and analysis
* Computational advertising
* Computational aspects of equilibria
* Computational social choice
* Convergence and learning in games
* Coalitions, coordination and collective action
* Economics aspects of security and privacy
* Economics aspects of distributed and network computing
* Information and attention economics
* Network games
* Price differentiation and price dynamics
* Social networks.
Submission Format
Authors are invited to submit extended abstracts presenting original
research on any of the research fields related to WINE’11. No
simultaneous submission to other publication outlets (either a
conference or a journal) is allowed.
An extended abstract submitted to WINE’11 should start with the title
of the paper, each author’s name, affiliation and e-mail address,
followed by a one-paragraph summary of the results to be presented.
This should then be followed by a technical exposition of the main
ideas and techniques used to achieve these results, including
motivation and a clear comparison with related work. The extended
abstract should not exceed 12 single-spaced pages (full papers) or 6
pages (short papers) using reasonable margins and at least 10-point
font (excluding references and title page). If the authors believe
that more details are essential to substantiate the claims of the
paper, they may include a clearly marked appendix (with no space
limit) that will be read at the discretion of the Program Committee.
It is strongly recommended that submissions adhere to the specified
format and length. Submissions that are clearly too long may be
rejected immediately. The proceedings of the conference will be
published by Springer-Verlag in the Lecture Notes in Computer Science
series, and will be available for distribution at the conference.
Submissions are strongly encouraged, though not required, to follow
the LNCS format.
Submission of Working Papers
To accommodate the publishing traditions of different fields, we allow
the authors to submit working papers that they intend to publish in
journals that do not accept papers previously published in conference
proceedings. These submissions will be reviewed together with the
regular submission using the same acceptance criteria, but only a
one-page abstract will appear in the proceedings with a URL that
points to the full paper and that will be reliable for at least two
years. Open access is preferred although the paper can be hosted by a
publisher who takes copyright and limits access, as long as there is a
link to the location. At the submission stage, such papers should be
formatted in the same way as the regular submissions (in particular,
they can be submitted as long or short papers), but the title page
should state clearly that the submission is a working paper.
Important Dates
* Submission deadline (regular papers): July 31, 2011.
* Submission deadline (short papers): August 7, 2011.
* Notification: September 15, 2011.
* Camera-ready copy is due on September 28, 2011.
For more information and submission instructions, see the conference homepage:
http://web.spms.ntu.edu.sg/~wine11/
This may be of interest to CMSS members.
Special session on **Logics for Games and Social Choice**
CLIMA XII 12th International Workshop on Computational Logic in Multi-Agent Systems
http://centria.di.fct.unl.pt/events/climaXII/sessions.html
Barcelona, Spain, July 17-18, 2011.
Affiliated with IJCAI’11. Submission deadline: April 8.
We are planning a workshop in December. The first announcement from Arkadii Slinko:
The Centre for Mathematical Social Science at The University of Auckland (New Zealand) is planning a series of lectures and seminars given by visitors
and members of the Centre in the period of 13–22 of December 2010. At the moment the following visitors have expressed their intention to participate and give lectures:
– Clemens Puppe (KIT, Karlsruhe)
– Bill Zwicker (Union College, New York)
– Toby Walsh (University of NSW and NICTA)
– Igor Shparlinski (Macquarie University, Sydney)
This will be accompanied by discussions of future research directions and research collaborations in small groups with participation of visitors and local researchers including PhD and graduate students. The talks will take place in mornings and in the afternoon we will have sessions for discussions on topics relevant to the lectures.
======================
TOPICS AND DATES:
13 Dec (Monday) – Registration. Welcoming drink at Old Government House.
14 Dec (Tuesday) – Simple games and Secret Sharing.
15 Dec (Wednesday) – Cryptography.
17 Dec (Friday) – Comparative probabilities and simple games.
20 Dec (Monday) – Voting theory.
21 Dec (Tuesday) – Uncertainty, Ambiguity and Choice.
The exact schedule for each day will be announced later. During the weekend 18-19 of December we are planning an excursion.
======================
APPROXIMATE SCHEDULE:
Simple Games and Secret Sharing (organiser Arkadii Slinko)
1. Arkadii Slinko – Complete simple games and hierarchical secret sharing schemes.
2. Bill Zwicker – Hereditary rough weigtedness in simple games.
3. Ali Hameed – Weighted and roughly weighted ideal secret sharing schemes.
Topics for discussions in the afternoon session: simple games and secret sharing schemes, hereditary rough weightedness and its
characterisations, hierarchical simple games (access structures) and their properties.
Cryptography (organiser Steven Galbraith)
1. Igor Shparlinski – Group structures of elliptic curves over finite fields
2. Steven Galbraith – Introduction to “Learning With Errors” and lattice-based cryptography
3. Edoardo Persichetti – Compact McEliece keys using quasi-dyadic Srivastava codes
Topics for discussions in the afternoon session: Cryptography from codes, Homomorphic encryption, Lattices in cryptography.
Comparative probabilities and simple games (organiser Arkadii Slinko)
1. Arkadii Slinko – Abstract simplicial complexes which are initial segments of comparative probability orders
2. Tatyana Gvozdeva – On Edelman’s conjecture about simple games obtained from comparative probability orders
3. Ilya Chevyrev – On the number of facets of the convex polytope of a comparative probability order.
Topics for discussions in the afternoon session: Edelman’s conjecture, characterisations of weighted simple
games by polytopes
Uncertainty, Ambiguity and Choice (Organiser Matthew Ryan)
1. Clemens Puppe – “Majoritarian Indeterminacy and Path-Dependence: The Condorcet Efficient Set”
(based on joint work with Klaus Nehring and Markus Pivato)
2. Matthew Ryan – Abstract Convex Geometries and Decision Theory
3. Patrick Girard, Jeremy Seligman – Logic of Social Choice
Topics for discussions in the afternoon session: Abstract convexity in decision theory; abstract convexity in social choice; modal logic for ambiguous semantics.
Voting Theory (organiser Mark Wilson)
1. 1. Bill Zwicker – “The Geometry of Influence: Weighted Voting and Hyper-ellipsoids,” joint work with Nicolas Houy.
2. Toby Walsh – Manipulation of Borda and related voting rules
3. Reyhaneh Reyhani – Dynamics in voting games
4. Egor Ianovski – Safe manipulation of Borda
Topics for discussions in the afternoon session: Manipulation of Borda and related voting rules,
Manipulation with partial information, Lotteries and voting rules. Interplay between manipulability and decisiveness
Recent Comments