15,166 results for age

arxiv.org/abs/1705.05254v1

Strategically knowing how

In this paper, we propose a single-agent logic of goal-directed knowing how extending the standard epistemic logic of knowing that with a new knowing how operator. The semantics of the new operator is based on the idea that knowing how to achieve $φ...

arxiv.org/abs/1803.10827v2

Who Let The Dogs Out? Modeling Dog Behavior From Visual Data

We introduce the task of directly modeling a visually intelligent agent. Computer vision typically focuses on solving various subtasks related to visual intelligence. We depart from this standard approach to computer vision; instead we directly model...

www.bing.com/ck/a?!&&p=767ac294c764422c02997d11636f917daa667adf2c21adb16656529c4e8955d4JmltdHM9MTc3MjQwOTYwMA&ptn=3&ver=2&hsh=4&fclid=0aa64f27-f827-6640-034f-5836f98067ee&u=a1aHR0cHM6Ly9wbGF5Lmdvb2dsZS5jb20vc3RvcmUvYXBwcy9kZXRhaWxzP2lkPWluLnN0YXJ0di5ob3RzdGFyJmhsPWVuLVVT&ntb=1

JioHotstar - Apps on Google Play

Safety starts with understanding how developers collect and share your data. Data privacy and security practices may vary based on your use, region, and age. The developer provided this information and …

arxiv.org/abs/astro-ph/0407133v1

Spectroscopy of PNe in Sextans A, Sextans B, NGC 3109 and Fornax

Planetary nebulae (PNe) and HII regions provide a probe of the chemical enrichment and star formation history of a galaxy from intermediate ages to the present day. We present the first results of NTT spectroscopy of HII regions and/or PNe in four...

arxiv.org/abs/2503.06323v1

Higher-Order Belief in Incomplete Information MAIDs

Multi-agent influence diagrams (MAIDs) are probabilistic graphical models which represent strategic interactions between agents. MAIDs are equivalent to extensive form games (EFGs) but have a more compact and informative structure. However, MAIDs can...

en.wikipedia.org/wiki/Bette_Davis

Bette Davis - Wikipedia

per week, which Davis refused. Davis's agent, Mike Levee, said: "She's a very stubborn young lady. I asked her how much she wanted, and she said $3,500

www.bing.com/ck/a?!&&p=b9121a0dc12fea4c83768f1f381b36c4b72c74f8ec7029ced6ec6aeff21c3d88JmltdHM9MTc3MjQwOTYwMA&ptn=3&ver=2&hsh=4&fclid=0ebbfb6c-2142-64f0-196e-ec7d2080654f&u=a1aHR0cHM6Ly9wbGF5Lmdvb2dsZS5jb20vc3RvcmUvYXBwcy9kZXRhaWxzP2lkPWluLnN0YXJ0di5ob3RzdGFyJmhsPWVuLVVT&ntb=1

JioHotstar - Apps on Google Play

Safety starts with understanding how developers collect and share your data. Data privacy and security practices may vary based on your use, region, and age. The developer provided this information and …

arxiv.org/abs/2007.07027v1

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings

Envy-free up to one good (EF1) and envy-free up to any good (EFX) are two well-known extensions of envy-freeness for the case of indivisible items. It is shown that EF1 can always be guaranteed for agents with subadditive valuations. In sharp contras...

arxiv.org/abs/1902.08003v1

Minimal Envy and Popular Matchings

We study ex-post fairness in the object allocation problem where objects are valuable and commonly owned. A matching is fair from individual perspective if it has only inevitable envy towards agents who received most preferred objects -- minimal envy...

arxiv.org/abs/1003.5328v1

On the Interplay between Incentive Compatibility and Envy Freeness

We study mechanisms for an allocation of goods among agents, where agents have no incentive to lie about their true values (incentive compatible) and for which no agent will seek to exchange outcomes with another (envy-free). Mechanisms satisfying ea...

arxiv.org/abs/2406.09744v2

The Cost and Complexity of Minimizing Envy in House Allocation

We study almost-envy-freeness in house allocation, where $m$ houses are to be allocated among $n$ agents so that every agent receives exactly one house. An envy-free allocation need not exist, and therefore we may have to settle for relaxations of en...

arxiv.org/abs/1609.03938v2

Envy-Free Division of Land

Classic cake-cutting algorithms enable people with different preferences to divide among them a heterogeneous resource (``cake''), such that the resulting division is fair according to each agent's individual preferences. However, these algorithms ei...

arxiv.org/abs/0909.4569v1

Envy, Multi Envy, and Revenue Maximization

We study the envy free pricing problem faced by a seller who wishes to maximize revenue by setting prices for bundles of items. If there is an unlimited supply of items and agents are single minded then we show that finding the revenue maximizing e...