43:
136:. All of these procedures can be examined for various properties like monotonicity. Monotonicity has the property that voting for a candidate should not harm that candidate. This may seem obvious, true under any system, but it is something which can happen in STV. Another question would be the ability to elect a Condorcet winner in case there is one.
147:
and epistemic logic. Like programs, social procedures dovetail into each other. For instance an airport provides runways for planes to land, but it also provides security checks, and it must provide for ways in which buses and taxis can take arriving passengers to their local destinations. The entire
152:
and Taylor procedure for fair division have been analyzed in this way. To point to the need for epistemic logic, a building not only needs restrooms, for obvious reasons, it also needs signs indicating where they are. Thus epistemic considerations enter in addition to structural ones. For a more
139:
Other principles which are considered by researchers in social software include the concept that a procedure for fair division should be Pareto optimal, equitable and envy free. A procedure for auctions should be one which would encourage bidders to bid their actual valuation – a property which
127:
Current research in the area of social software include the analysis of social procedures and examination of them for fairness, appropriateness, correctness and efficiency. For example, an election procedure could be a simple majority vote,
110:
Work under the term social software has been going on since about 1996, and conferences in
Copenhagen, London, Utrecht and New York, have been partly or wholly devoted to it. Much of the work is carried out at the
103:
is an interdisciplinary research program that borrows mathematical tools and techniques from game theory and computer science in order to analyze and design
148:
mechanism can be analyzed in the way in which a complex computer program can be analyzed. The Banach-Knaster procedure for dividing a cake fairly, or the
107:. The goals of research in this field are modeling social situations, developing theories of correctness, and designing social procedures.
64:
491:
Mike
Wooldridge, Thomas Ågotnes, Paul E. Dunne, and Wiebe van der Hoek. Logic for Automated Mechanism Design – A Progress Report. In
430:
282:
86:
162:
143:
What is new in social software compared to older fields is the use of tools from computer science like program logic,
112:
57:
51:
68:
153:
urgent example, in addition to medicines, physicians also need tests to indicate what a patient's problem is.
532:. Knowledge, Games and Beliefs Group, City University of New York. May 18–19, 2007. Retrieved on 2009-06-26.
484:, Reasoning about Communication Graphs, in Interactive Logic, Edited by Johan van Benthem, Dov Gabbay and
144:
526:. Lorentz Center, Leiden University, Netherlands. 30 Oct 2006–3 Nov 2006. Retrieved on 2009-06-26.
481:
466:
446:
436:
343:
250:
239:
116:
545:
30:
This article is about the field of research. For computer software used for social interaction, see
310:
260:
404:
523:
357:
426:
278:
197:
325:
192:
187:
182:
104:
353:
270:
167:
133:
31:
550:
371:
539:
485:
329:
172:
400:
367:
306:
302:
149:
396:
379:
375:
229:
177:
129:
493:
Proceedings of the Twenty-Second
Conference on Artificial Intelligence (AAAI-07
457:
17:
425:, Ph.D. Thesis, University of Amsterdam. ILLC Dissertation Series 2001–10,
529:
514:. Carlsberg Academy, Copenhagen. May 27–29, 2004. Retrieved on 2009-06-26.
511:
520:. King's College, London. November 4–7, 2005. Retrieved on 2009-06-26.
257:, ed. Dina Goldin, Sott Smolka, Peter Wegner, Springer 2007, 441–461.
275:
Knowledge and Belief: an introduction to the logic of the two notions
441:
Future Pasts: the
Analytic Tradition in Twentieth Century Philosophy
505:
416:
Rational ritual : culture, coordination, and common knowledge
517:
336:
J. Geanakoplos and H. Polemarchakis, We Can't
Disagree Forever,
449:
and
Ramanujam, R., A knowledge based semantics of messages, in
459:
Topics in Social
Software: Information in Strategic Situations
36:
253:, "Social Interaction, Knowledge, and Social Software", in
462:, Doctoral dissertation, City University of New York (2005).
443:, Ed. J. Floyd and S. Shieh, Oxford U. Press, 2001, 339–350.
391:
The Win-Win
Solution: guaranteeing fair shares to everybody,
346:
and P. Krasucki, Communication, Consensus and
Knowledge,
469:
and Eva Cogan, The Logic of
Knowledge Based Obligation,
119:, who was influential in the development of the field.
518:
Interactive Logic: Games and Social Software workshop
508:. City University of New York, Graduate Center.
8:
358:Inductive reasoning and bounded rationality
524:Games, action and social software workshop
236:(1995) New York : Free Press, c1995.
311:"Information, trade and common knowledge"
255:Interactive Computation: The New Paradigm
87:Learn how and when to remove this message
50:This article includes a list of general
209:
132:, a Single Transferable vote (STV), or
99:In philosophy and the social sciences,
7:
418:, Princeton University Press, 2001.
451:J. Logic, Language, and Information
439:, Language as social software, in
506:Knowledge, Games and Beliefs Group
277:, Cornell University press, 1962,
234:The Construction of Social Reality
56:it lacks sufficient corresponding
27:Interdisciplinary research program
25:
471:Knowledge, Rationality and Action
294:R. Aumann, Agreeing to disagree,
289:Convention, a Philosophical Study
495:), Vancouver, Canada, July 2007.
140:holds with the Vickrey auction.
41:
530:Social Software Mini-conference
453:, 12, pp. 453 – 467, 2003.
389:Steven Brams and Alan Taylor,
1:
362:Complexity in Economic Theory
265:Philosophical Investigations,
330:10.1016/0022-0531(82)90046-1
350:52 (1990) pp. 178–189.
113:City University of New York
567:
512:Social Software conference
477:, 149(2), 311 – 341, 2006.
318:Journal of Economic Theory
29:
423:Logic for Social Software
384:Reasoning about Knowledge
291:, Harvard U. Press, 1969.
246:, 132, Sep 2002, 187–211.
115:under the leadership of
71:more precise citations.
364:, 84(2):406-411, 1994.
145:analysis of algorithms
340:, 28 (1982), 192–200.
298:, 4 (1976) 1236–1239.
242:, “Social Software,”
117:Rohit Jivanlal Parikh
296:Annals of Statistics
261:Ludwig Wittgenstein
216:Pacuit (2005), p.10
473:, a subjournal of
411:, MIT Press, 2000.
348:J. Economic Theory
338:J. Economic Theory
386:, MIT Press 1995.
198:Social technology
105:social procedures
97:
96:
89:
16:(Redirected from
558:
480:Eric Pacuit and
333:
315:
267:Macmillan, 1953.
249:Eric Pacuit and
217:
214:
193:Social procedure
188:No-trade theorem
183:Mechanism design
92:
85:
81:
78:
72:
67:this article by
58:inline citations
45:
44:
37:
21:
566:
565:
561:
560:
559:
557:
556:
555:
536:
535:
502:
354:W. Brian Arthur
313:
301:
271:Jaakko Hintikka
226:
224:Further reading
221:
220:
215:
211:
206:
168:Epistemic logic
159:
134:Approval voting
125:
123:Goals and tools
101:social software
93:
82:
76:
73:
63:Please help to
62:
46:
42:
35:
32:Social software
28:
23:
22:
18:Social Software
15:
12:
11:
5:
564:
562:
554:
553:
548:
538:
537:
534:
533:
527:
521:
515:
509:
501:
500:External links
498:
497:
496:
489:
478:
463:
454:
444:
434:
419:
414:Michael Chwe,
412:
394:
387:
372:Joseph Halpern
365:
351:
341:
334:
299:
292:
285:
268:
258:
247:
237:
225:
222:
219:
218:
208:
207:
205:
202:
201:
200:
195:
190:
185:
180:
175:
170:
165:
158:
155:
124:
121:
95:
94:
49:
47:
40:
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
563:
552:
549:
547:
544:
543:
541:
531:
528:
525:
522:
519:
516:
513:
510:
507:
504:
503:
499:
494:
490:
487:
486:Benedikt Lowe
483:
479:
476:
472:
468:
465:Eric Pacuit,
464:
461:
460:
456:Eric Pacuit,
455:
452:
448:
445:
442:
438:
435:
432:
431:90-6196-510-1
428:
424:
420:
417:
413:
410:
409:Dynamic Logic
406:
402:
398:
395:
392:
388:
385:
381:
377:
373:
369:
366:
363:
359:
355:
352:
349:
345:
342:
339:
335:
331:
327:
323:
319:
312:
308:
304:
300:
297:
293:
290:
286:
284:
283:9781904987086
280:
276:
272:
269:
266:
262:
259:
256:
252:
248:
245:
241:
238:
235:
231:
228:
227:
223:
213:
210:
203:
199:
196:
194:
191:
189:
186:
184:
181:
179:
176:
174:
173:Fair division
171:
169:
166:
164:
163:Dynamic logic
161:
160:
156:
154:
151:
146:
141:
137:
135:
131:
122:
120:
118:
114:
108:
106:
102:
91:
88:
80:
70:
66:
60:
59:
53:
48:
39:
38:
33:
19:
492:
482:Rohit Parikh
474:
470:
467:Rohit Parikh
458:
450:
440:
437:Rohit Parikh
422:
421:Marc Pauly,
415:
408:
405:Jerzy Tiuryn
401:Dexter Kozen
393:Norton 1999.
390:
383:
368:Ronald Fagin
361:
347:
337:
324:(1): 17–27.
321:
317:
307:Nancy Stokey
303:Paul Milgrom
295:
288:
274:
264:
254:
251:Rohit Parikh
243:
240:Rohit Parikh
233:
212:
142:
138:
126:
109:
100:
98:
83:
74:
55:
546:Game theory
397:David Harel
380:Moshe Vardi
376:Yoram Moses
230:John Searle
178:Game theory
130:Borda count
69:introducing
540:Categories
447:Parikh, R.
287:D. Lewis,
77:April 2022
52:references
344:R. Parikh
475:Synthese
309:(1982).
244:Synthese
157:See also
488:(2007).
65:improve
429:
281:
54:, but
551:Logic
314:(PDF)
204:Notes
150:Brams
427:ISBN
403:and
378:and
305:and
279:ISBN
326:doi
542::
407:,
399:,
382:,
374:,
370:,
360:.
356:.
322:26
320:.
316:.
273:,
263:,
232:,
433:.
332:.
328::
90:)
84:(
79:)
75:(
61:.
34:.
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.