Abstract: Computerized devices search each of a group of different calendars of a group of attendees of a proposed event for an available timeslot within each of the calendars that meets boundary conditions specified for the proposed event. In response to failing to find an available time slot in common to all attendee calendars that meets the boundary conditions, the devices autonomously identify a common existing event scheduled within the calendars of the attendees that can accommodate the boundary conditions and add the new event to the existing event, or reschedule a previously scheduled event of one or more of the attendees to create a common, free timeslot for the new event where the event cannot be accommodated within an existing event.

Abstract: Computerized devices search each of a group of different calendars of a group of attendees of a proposed event for an available timeslot within each of the calendars that meets boundary conditions specified for the proposed event. In response to failing to find an available time slot in common to all attendee calendars that meets the boundary conditions, the devices autonomously identify a common existing event scheduled within the calendars of the attendees that can accommodate the boundary conditions and add the new event to the existing event, or reschedule a previously scheduled event of one or more of the attendees to create a common, free timeslot for the new event where the event cannot be accommodated within an existing event.