Imperfect recall games represent dynamic interactions where players forget previously known information, such as history of played actions. The importance of imperfect recall games stems from allowing a concise representation of strategies compared to perfect recall games where players remember all information. However, most of the algorith-mic results are negative for imperfect recall games – ...

An active stream of research is devoted to the design of polynomial approximation algorithms for the fair allocation of indivisible goods. Central to this field is the MaxMin Allocation problem, for which there is a significant gap between known approximation and inapproximability results. Closing this gap is a stimulating challenge. To this end, we consider a regular version of MaxMin Allocati...

We study fairness in a multicast network. We assume that the source hierarchically encodes its signal and the hierarchical structure is predetermined. We study fair allocation of utilities, where utility of a bandwidth can be the number of layers or the bandwidth itself, or any other function of the bandwidth depending on system requirements. The utility function is not strictly increasing in g...

| We study fairness when receivers in a multi-cast network can not subscribe to fractional layers. This case arises when the source hierarchically encodes its signal and the hierarchical structure is predetermined. Unlike the case of the fractional layer allocation, which has been studied extensively in 14], bandwidth can be allocated in discrete chunks only. Fairness issues become vastly diier...

We study fairness in a multicast network. We assume that the source hierarchically encodes its signal and the hierarchical structure is predetermined. We study fair allocation of utilities, where utility of a bandwidth can be the number of layers or the bandwidth itself, or any other function of the bandwidth depending on system requirements. The utility function is not strictly increasing in g...

MOTIVATION AND MODELING Maxmin (choosing an alternative with the highest minimal outcome) and maxmax (choosing an alternative with the highest maximal outcome) have played an important role as tools and concepts in the choice literature. They have been used as assumptions and derived as solutions to optimization problems in a wide range of applications: individual decision making under risk and...

This article reexamines the implications of stochastic lump-sum money transfers in a monetary overlapping generations’ model, wherein agents are endowed with maxmin expected utility preferences. It is shown that: 1) there exists continuum stationary equilibria, unique optimal one might exist, and 2) there exist innumerable nonstationary monetary equilibria, the real balance can move freely...

We study fairness when receivers in a multicast network can not subscribe to fractional layers. This case arises when the source hierarchically encodes its signal and the hierarchical structure is predetermined. Unlike the case of the fractional layer allocation, which has been studied extensively in [29], bandwidth can be allocated in discrete chunks only. Fairness issues become vastly differe...

This paper introduces a scalable maxmin flow control protocol which guarantees the minimum rate for each connection-oriented flow without requiring per-flow information. The protocol is called MR-ASAP (Minimum Rate guaranteeing Adaptive Source-link Accounting Protocol). MR-ASAP is an extension of ASAP [Tsa98a, Kim99], the first exact maxmin flow control protocol for best-effort connection-orien...