Results 261 to 270 of about 4,294,743 (304)
Dynamics of Mean-Field Fermi Systems with Nonzero Pairing. [PDF]
Ann Henri PoincareMarcantoni S, Porta M, Sabin J.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2020We study fair allocation of undesirable indivisible items (or chores) and make three contributions: First, we show that determining the existence of an envy-free allocation is NP-complete even when agents have binary additive valuations.
U. Bhaskar, A. Sricharan, Rohit Vaish
semanticscholar +1 more source
Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items
ACM Conference on Economics and Computation, 2019Several fairness concepts have been proposed recently in attempts to approximate envy-freeness in settings with indivisible goods. Among them, the concept of envy-freeness up to any item (EFX) is arguably the closest to envy-freeness.
I. Caragiannis, N. Gravin, Xin Huang
semanticscholar +1 more source
2006
Receipt-freeness is the property of voting protocols that a voter cannot create a receipt which proves how she voted. Since Benaloh and Tuinstra introduced this property, there has been a large amount of work devoted to the construction of receipt-free voting protocols.
Jonker, H.L., Vink, de, E.P.
openaire +1 more source
Receipt-freeness is the property of voting protocols that a voter cannot create a receipt which proves how she voted. Since Benaloh and Tuinstra introduced this property, there has been a large amount of work devoted to the construction of receipt-free voting protocols.
Jonker, H.L., Vink, de, E.P.
openaire +1 more source
A Complete Landscape for the Price of Envy-Freeness
Adaptive Agents and Multi-Agent SystemsWe study the efficiency of fair allocations using the well-studied price of fairness concept, which quantitatively measures the worst-case efficiency loss when imposing fairness constraints.
Zihao Li +4 more
semanticscholar +1 more source
A Hopf Algebra Freeness Theorem
American Journal of Mathematics, 1989The authors prove the conjecture that every finite-dimensional Hopf algebra H over a field k is a free (left or right) module over any Hopf subalgebra B. This was first proved by the second author in the case when \(B=kG\), G the group of group-like elements, is semi-simple [J.
Nichols, Warren D., Zoeller, M. Bettina
openaire +1 more source
Nous: Drop-Freeness and Duplicate-Freeness for Consistent Updating in SDN Multicast Routing
IEEE/ACM Transactions on NetworkingConsistent routing updates through Software-Defined Networking (SDN) can be difficult due to the asynchronous and distributed nature of the data plane. Recent studies have achieved consistent unicast routing updates. However, achieving consistent updates
Xiaofeng Gao +6 more
semanticscholar +1 more source
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013
Testing a property P of graphs in the bounded-degree model deals with the following problem: given a graph G of bounded degree d, we should distinguish (with probability 2/3, say) between the case that G satisfies P and the case that one should add/remove at least e dn edges of $G$ to make it satisfy P.
Ken-ichi Kawarabayashi, Yuichi Yoshida
openaire +1 more source
Testing a property P of graphs in the bounded-degree model deals with the following problem: given a graph G of bounded degree d, we should distinguish (with probability 2/3, say) between the case that G satisfies P and the case that one should add/remove at least e dn edges of $G$ to make it satisfy P.
Ken-ichi Kawarabayashi, Yuichi Yoshida
openaire +1 more source